Výsledky vyhledávání - Numerical Algorithms AND Problems—Number-theoretic computations Keywords sparse*

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

Autoři: Martín Avendaño Ashraf Ibrahim J. Maurice Rojas a další

Přispěvatelé: Martín Avendaño Ashraf Ibrahim J. Maurice Rojas a další

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

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

Popis souboru: application/pdf

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

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

Arithmetic Complexity.

Autoři: VAN DEN DRIES, LOU MOSCHOVAKIS, YIANNIS N.

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

Témata: ARITHMETIC functions, NUMBER theory, MULTIPLICATION, SUBTRACTION (Mathematics), ALGORITHMS

Number Theory

Autoři: David V. Chudnovsky Gregory V. Chudnovsky Melvyn B. Nathanson

Resource Type: eBook.

Témata: Number theory--Congresses

Categories: MATHEMATICS / Number Theory