Suchergebnisse - Numerical Algorithms and Problems—Number-theoretic computations Keywords sparse*

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

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

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

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

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

Dateibeschreibung: application/pdf

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

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

Arithmetic Complexity.

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

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

Schlagwörter: ARITHMETIC functions, NUMBER theory, MULTIPLICATION, SUBTRACTION (Mathematics), ALGORITHMS

Number Theory

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

Resource Type: eBook.

Schlagworte: Number theory--Congresses

Categories: MATHEMATICS / Number Theory