Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Numerical Algorithms And Problems (F.2.1)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 216 Reviews about "Numerical Algorithms And Problems (F.2.1)": Date Reviewed   Algorithm 993: efficient computation with Kronecker products Fackler P. ACM Transactions on Mathematical Software 45(2): 1-9, 2019.  Type: Article The Kronecker product of two matrices replaces each element of the first matrix with a multiple of a copy of the second matrix. The history, applications, and properties of the Kronecker and the symmetric products are well known [1,2].... Aug 14 2019   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 This is the paper version of Roche’s ISSAC 2018 tutorial, which serves as an update to my work [1]. It is an excellent tutorial, written in a clear and accessible style. ISSAC is to be commended for these tutorials, and I wis... Oct 10 2018   A verified ODE solver and the Lorenz attractor Immler F. Journal of Automated Reasoning 61(1-4): 73-111, 2018.  Type: Article Lorenz used a system of ordinary differential equations (ODEs) to study atmospheric dynamics phenomena [1]. He established the great sensitivity of the results obtained by this simplified model to very small, nearly negligible changes ... Aug 27 2018   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) A good definition of the word “game” in the context of game theory is provided in this book:... Feb 21 2018   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 A permutation polynomial (PP) over a finite field Fq is a polynomial over Fq that maps Fq onto itself, that is, permutes the elements of Jun 28 2017   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) This is the second edition of a respected text on number theory. The subtitle--an introduction via the density of primes--explains its orientation. It’s certainly ambitious, proving the prime number t... Jun 2 2017   Quantum computational number theory Yan S., Springer International Publishing, New York, NY, 2015. 252 pp.  Type: Book (978-3-319258-21-8) The idea of quantum computing including the quantum Turing machine originated in the last century. However, real interest in quantum computing developed after the seminal paper by Peter Shor [1], where he gave polynomial-time algorithm... Apr 26 2017   Summing it up: from one plus one to modern number theory Ash A., Gross R., Princeton University Press, Princeton, NJ, 2016. 248 pp.  Type: Book (978-0-691170-19-0) I am not an official number theorist, like most in the target readership of this intriguing book, but I do belong to the set of “math enthusiasts of all backgrounds” for whom this book was written.... Jan 26 2017   A new faster algorithm for factoring skew polynomials over finite fields Caruso X., Le Borgne J. Journal of Symbolic Computation 79, Part 2, 411-443, 2017.  Type: Article Let k be a finite field of characteristic p and size pqr, and let σ be an automorphism of k of order r. The ring of skew... Jan 13 2017   Quadratic maps are hard to sample Viola E. ACM Transactions on Computation Theory 8(4): 1-4, 2016.  Type: Article A quadratic map is a function of the form f (x) = ax2 + bx + c, or more generally,... Jul 26 2016       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy