Deciding Properties of Polynomials without Factoring

Deciding Properties of Polynomials without Factoring (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Tomas Sander , M. Amin Shokrollahi

BibTeX

@MISC{Sander97decidingproperties,
    author = {Tomas Sander and M. Amin Shokrollahi},
    title = {Deciding Properties of Polynomials without Factoring},
    year = {1997}
}

Bookmark

OpenURL

Abstract

The polynomial time algorithm of Lenstra, Lenstra, and Lovasz [17] for

Citations

759	A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics - Cohen - 1993
553	Factoring Polynomials with Rational Coefficients - Lenstra, Lovàsz - 1982
348	zur Gathen and - von - 1999
181	Riemann’s hypothesis and tests for primality - Miller - 1976
144	Introduction to Cyclotomic Fields - Washington - 1997
81	Effective Versions of the Chebotarev Density Theorem,” Algebraic Number Fields - Lagarias, Odlyzko - 1975
64	Algorithmic Number Theory - Bach, Shallit - 1996
39	Factoring polynomials over algebraic number fields - Landau - 1985
33	Algorithms in algebraic number theory - Lenstra - 1992
29	Algebraic Number Fields - Janusz - 1973
27	Factorization of Univariate Integer Polynomials by Diophantine Approximation and an Improved Basis Reduction Algorithm - SCHÖNHAGE - 1984
19	Factoring polynomials over algebraic number fields - Lenstra - 1983
18	Factoring multivariate polynomials over algebraic number fields - Lenstra - 1987
18	Class Field Theory - NEUKIRCH - 1986
16	Approximating rings of integers in number fields - Buchmann, Lenstra - 1994
16	Algebraic Complexity Theory. Number 315 in Grundlehren der mathematischen Wissenschaften - BŰRGISSER, CLAUSEN, et al. - 1997
16	Versions Effectives du Théorème de Chebotarev sous l’Hypothèse de Riemann Généralisée,” Astérisque 61 - Oesterlé - 1979
14	Explicit bounds for primes in residue classes - Bach, Sorenson - 1996
13	The complexity of the construction of the ring of integers of a global field - Chistov - 1989
7	Die Bestimmung der Dichtigkeit einer Menge von Primzahlen, welche zu einer gegebenen Substitutionsklasse gehören - Chebotarev - 1926
7	price discrimination on the - Odlyzko, “Privacy - 2003
5	Complexity of algorithms in algebraic number theory - Buchmann - 1990
5	Some remarks on computing the square parts of integers - Landau - 1988
2	Construction of fields of algebraic numbers with given solvable Galois group - Shafarevich - 1954
1	Polynomial-time factoring of multivariable polynomials over a general field - Grigoreiv - 1982
1	A note on the different of the composed field - Toyama - 1955