Author of the publication

Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.

, , and . ISSAC, page 117-122. ACM, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields., , and . SIAM J. Comput., 19 (6): 1059-1063 (1990)A Lower Bound for Randomized Algebraic Decision Trees., , , and . STOC, page 612-619. ACM, (1996)Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis., , and . ISSAC, page 117-122. ACM, (1992)Polynomial time approximation schemes for dense instances of NP-hard problems., , and . STOC, page 284-293. ACM, (1995)Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields., , , , and . Algorithmica, 80 (2): 560-575 (2018)On a Sublinear Time Parallel Construction of Optimal Binary Search Trees., and . Parallel Process. Lett., 8 (3): 387-397 (1998)Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies.. FCT, volume 9210 of Lecture Notes in Computer Science, page 3-11. Springer, (2015)The Equivalences Problems for Binary EOL-Systems are Decidable.. FCT, volume 56 of Lecture Notes in Computer Science, page 423-434. Springer, (1977)Approximating the Volume of General Pfaffian Bodies., and . Structures in Logic and Computer Science, volume 1261 of Lecture Notes in Computer Science, page 162-173. Springer, (1997)Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)., , , and . Dagstuhl Reports, 5 (6): 28-47 (2015)