Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Numerical Algorithms And Problems (F.2.1)
 
  Numerical Algorithms And Problems (F.2.1) See Reviews  
 
Subject Descriptors:
Computation Of Transforms (111)
Computations In Finite Fields (48)
Computations On Matrices (182)
Computations On Polynomials (141)
Number-Theoretic Computations (170)
 
Proper Nouns:
There are no proper nouns with reviews under F.2.1.
 
 
Reviews limited to:
 
 

Reviews about "Numerical Algorithms And Problems (F.2.1)":
Algorithm 993: efficient computation with Kronecker products
Fackler P.  ACM Transactions on Mathematical Software 45(2): 1-9, 2019. Type: Article
What can (and can’t) we do with sparse polynomials?
Roche D.  ISSAC 2018 (Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, New York, NY,  Jul 16-19, 2018) 25-30, 2018. Type: Proceedings
A verified ODE solver and the Lorenz attractor
Immler F.  Journal of Automated Reasoning 61(1-4): 73-111, 2018. Type: Article
Game theory: a classical introduction, mathematical games, and the tournament
McEachern A.,  Morgan & Claypool Publishers, San Rafael, CA, 2017. 118 pp. Type: Book (978-1-681731-58-2)
Some new results on permutation polynomials over finite fields
Ma J., Zhang T., Feng T., Ge G.  Designs, Codes and Cryptography 83(2): 425-443, 2017. Type: Article
Number theory: an introduction via the density of primes (2nd ed.)
Fine B., Rosenberger G.,  Birkhäuser Basel, Cham, Switzerland, 2016. 413 pp. Type: Book (978-3-319438-73-3)
Quantum computational number theory
Yan S.,  Springer International Publishing, New York, NY, 2015. 252 pp. Type: Book (978-3-319258-21-8)
more...
Related Topics
F.2.1 Numerical Algorithms And Problems
  - Numerical Analysis
  - Symbolic and Algebraic Manipulation
  - Mathematical Software
   
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy