Search Results - Numerical Algorithms AND Problems—Number-theoretic computations Keywords sparse~

Randomized NP-Completeness for p-adic Rational Roots of Sparse Polynomials in One Variable

Authors: Martín Avendaño Ashraf Ibrahim J. Maurice Rojas et al.

Contributors: Martín Avendaño Ashraf Ibrahim J. Maurice Rojas et al.

Source: http://www.math.tamu.edu/~rojas/mu.pdf.

Subject Terms: F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Number-theoretic computations Keywords sparse, p-adic, feasibility, NP, arithmetic progression

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.2353; http://www.math.tamu.edu/~rojas/mu.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.2353
http://www.math.tamu.edu/~rojas/mu.pdf

Arithmetic Complexity.

Authors: VAN DEN DRIES, LOU MOSCHOVAKIS, YIANNIS N.

Source: ACM Transactions on Computational Logic; Jan2009, Vol. 10 Issue 1, p2-2:49, 49p

Subject Terms: ARITHMETIC functions, NUMBER theory, MULTIPLICATION, SUBTRACTION (Mathematics), ALGORITHMS

Number Theory

Authors: David V. Chudnovsky Gregory V. Chudnovsky Melvyn B. Nathanson

Resource Type: eBook.

Subjects: Number theory--Congresses

Categories: MATHEMATICS / Number Theory