Article

Free access

Checking polynomial identities over any field: towards a derandomization?

Authors:

Daniel Lewin,

Salil VadhanAuthors Info & Claims

STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing

Pages 438 - 447

https://doi.org/10.1145/276698.276856

Published: 23 May 1998 Publication History

PDF eReader

References

[1]

S. Arora, C. Lurid, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the Thirty Third Annual Symposium on Foundations of Computer Science, pages 14-23, 1992.

Digital Library

Google Scholar

[2]

S. Arora and S. Safra. Probabilistic checking of proofs. In Proceedings of the Thirty Third Annual Symposium on Foundations of Computer Science, pages 2- 13, 1992.

Google Scholar

[3]

M. Blum, A.K. Chandra, and M.N. Wegman. Equivalence of free Boolean graphs can be tested in polynomial time. Information Processing Letters, 10:80--.82, 1980.

Crossref

Google Scholar

[4]

l.~z16 Babai, Lance Formow, and Carsten Lund. Nondeterministic exponential time has two-prover interactive protocols. In 31st Annual S~mpositan on Foundations of Computer Science, volume I, pages 16.-25, St. Louis, Missouri, 22-24 October 1990. IEEE.

Google Scholar

[5]

M. Blum and S. Khanna. Designing programs that check their work. Journal of the Association for Computing Machinery, 42:269--291, 1995.

Digital Library

Google Scholar

[6]

Michael Clausen, Andreas Dress, Johannes Grab. meier, and Marek Karpinski. On zero-testing and inter. polation of k-sparse multivariate polynomials over finite fields. Theoretical Computer Science, 84(2):151- 164, 29 July 1991.

Digital Library

Google Scholar

[7]

Zlfi-~ong Chert and Ming-Yang Kao. Reducing randomness via irrational numbers. In Proceedings of the TwenO,-IVinth Annual ACM Symposium on Theory of Computing, pages 200--209, El Paso, Texas, 4--6 May 1997.

Digital Library

Google Scholar

[8]

Suresh Chad, Pankaj Rohatgi, and Aravind Srini,asan. Randomness-optimal unique element isolation with applications to perfect matching and related problems. SIAM Journal on Computing, 24(5): 1036-1050, October 1995.

Digital Library

Google Scholar

[9]

David Eisenbud. Commutative Algebra with a View Toward Algebraic Geometry. Graduate Texts in Mathematies 150. Springer-Verlag, 1995.

Google Scholar

[10]

Dima Yu. Grigoriev, Marek Karpinski, and Michael F. Singer. Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM Journal on Computing, 19(6):1059-1063, December 1990.

Digital Library

Google Scholar

[11]

Erich Kaltofen. A polynomial reduction from multivariate to bivariate integral polynomial factoriz;ation. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 261-266, San Francisco, California, 5--7 May 1982.

Digital Library

Google Scholar

[12]

Erich Kaltofen. Greatest common divisors of polynomials given by straight-line programs. Journal of tfle Association for Computing Machinery, 35(I ):231- 264, January 1988.

Digital Library

Google Scholar

[13]

Serge Lang. Algebra. Addison-Wesley, 3 edition, 1993.

Google Scholar

[14]

C. Lund, L. Fortnow, H. Karlofi, and N. Nisan. Algebraic methods for interactive proofs. In Proceedings of the ThirO, First Annual Sympositan on Foundations of Computer Science, pages 1-10, 1990.

Google Scholar

[15]

L. Lovasz. On determinants, matehings, and random algorithms. In L. Budach, editor, Fundamentals of Computing Theot3.,. Akademia-Verlag, 1979.

Google Scholar

[16]

Daniel Lewin and Salil Vadhan. Checking polynomial identities over any field: Towards a derandomization7 Available from http: / / theory, lcs .mi t. edu/~danl or http: //www-math.mi t. edu/~salil, 1~98.

Google Scholar

[17]

K. Mulmuley, U. Vazirani, and V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7(1):105-113, 1987.

Digital Library

Google Scholar

[18]

Ron M. Roth and Gyora M. Benedek. Interpolation and approximation of sparse multivariate polynomials over GF(2). SIAM Journal on Computing, 20(2):291- 314, April 1991.

Digital Library

Google Scholar

[19]

J.T. Schwartz. Fast probabilistie algorithms fer verification of polynomial identifies. Journal of the Association for Computing MachineD, 27(4):701-717, October 1980.

Digital Library

Google Scholar

[20]

Adi Shamir. IP=PSPACE. In Proceedings ofthe Thirty First Annual Symposium on Foundations of Computer Science, pages 11-15, 1990.

Google Scholar

[21]

V. Strassen. Berechnung und programm I. Acta informatica, 1:320--335, 1972. In German.

Digital Library

Google Scholar

[22]

Joachim yon zur Gathen and Erich Kaltofen. Factoring sparse multivariate polynomials. Journal of Computer and System Sciences, 31 (2):265-287, October 1985.

Digital Library

Google Scholar

[23]

R.E. Zippel. Probabilistie algorithms for sparse polynomials. In Proceedings of EUROSAM '79, pages 216-226. Springer-Verlag, 1979. Lecture Notes in Computer Science, vol. 72.

Digital Library

Google Scholar

[24]

R. Zippel. Newton's iteration and the sparse Hensel algorithm. In Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation, pages 68-72, Utah, 1981.

Digital Library

Google Scholar

Cited By

View all

Doron DTa-Shma ATell R(2022)On Hitting-Set Generators for Polynomials that Vanish RarelyComputational Complexity10.1007/s00037-022-00229-231:2Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1007/s00037-022-00229-2
Neri AHorlemann-Trautmann A(2019)Random construction of partial MDS codesDesigns, Codes and Cryptography10.1007/s10623-019-00705-xOnline publication date: 18-Dec-2019
https://doi.org/10.1007/s10623-019-00705-x
Neri AHorlemann-Trautmann ARandrianarisoa TRosenthal J(2017)On the genericity of maximum rank distance and Gabidulin codesDesigns, Codes and Cryptography10.1007/s10623-017-0354-486:2(341-363)Online publication date: 8-Apr-2017
https://doi.org/10.1007/s10623-017-0354-4
Show More Cited By

Index Terms

Checking polynomial identities over any field: towards a derandomization?
1. Computing methodologies
  1. Symbolic and algebraic manipulation
2. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations in finite fields
      2. Computations on polynomials
  2. Probability and statistics
    1. Probabilistic algorithms
    2. Probabilistic reasoning algorithms
      1. Markov-chain Monte Carlo methods
      2. Sequential Monte Carlo methods

Recommendations

Polynomial kernels for weighted problems

We use a technique by Frank and Tardos (Combinatorica 1987) to settle an open problem in kernelization.We present a polynomial kernelization for Knapsack parameterized by number of items.The method can be generally used to obtain polynomial kernels for ...
Derandomizing polynomial identity tests means proving circuit lower bounds

We show that derandomizing Polynomial Identity Testing is essentially equivalent to proving arithmetic circuit lower bounds for NEXP. More precisely, we prove that if one can test in polynomial time (or even nondeterministic subexponential time, ...
Average-case complexity theory and polynomial-time reductions

Comments

Information & Contributors

Information

Published In

STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing

May 1998

684 pages

ISBN:0897919629

DOI:10.1145/276698

Chairman:
Jeffrey Vitter

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 May 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC98

Sponsor:

SIGACT

STOC98: The 30th Annual ACM Symposium on Theory of Computing

May 24 - 26, 1998

Texas, Dallas, USA

Acceptance Rates

STOC '98 Paper Acceptance Rate 75 of 169 submissions, 44%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
598
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)8

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Doron DTa-Shma ATell R(2022)On Hitting-Set Generators for Polynomials that Vanish RarelyComputational Complexity10.1007/s00037-022-00229-231:2Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1007/s00037-022-00229-2
Neri AHorlemann-Trautmann A(2019)Random construction of partial MDS codesDesigns, Codes and Cryptography10.1007/s10623-019-00705-xOnline publication date: 18-Dec-2019
https://doi.org/10.1007/s10623-019-00705-x
Neri AHorlemann-Trautmann ARandrianarisoa TRosenthal J(2017)On the genericity of maximum rank distance and Gabidulin codesDesigns, Codes and Cryptography10.1007/s10623-017-0354-486:2(341-363)Online publication date: 8-Apr-2017
https://doi.org/10.1007/s10623-017-0354-4
Saxena NSeshadhri C(2013)From sylvester-gallai configurations to rank boundsJournal of the ACM10.1145/252840360:5(1-33)Online publication date: 28-Oct-2013
https://dl.acm.org/doi/10.1145/2528403
Beecken MMittmann JSaxena N(2013)Algebraic independence and blackbox identity testingInformation and Computation10.1016/j.ic.2012.10.004222(2-19)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1016/j.ic.2012.10.004
Saha CSaptharishi RSaxena N(2013)A Case of Depth-3 Identity Testing, Sparse Factorization and DualityComputational Complexity10.1007/s00037-012-0054-422:1(39-69)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1007/s00037-012-0054-4
Beecken MMittmann JSaxena N(2011)Algebraic independence and blackbox identity testingProceedings of the 38th international conference on Automata, languages and programming - Volume Part II10.5555/2027223.2027236(137-148)Online publication date: 4-Jul-2011
https://dl.acm.org/doi/10.5555/2027223.2027236
Saxena NSeshadhri CFortnow LVadhan S(2011)Blackbox identity testing for bounded top fanin depth-3 circuitsProceedings of the forty-third annual ACM symposium on Theory of computing10.1145/1993636.1993694(431-440)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993636.1993694
Beecken MMittmann JSaxena N(2011)Algebraic Independence and Blackbox Identity TestingAutomata, Languages and Programming10.1007/978-3-642-22012-8_10(137-148)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22012-8_10
Shpilka A(2011)Recent Results on Polynomial Identity TestingComputer Science – Theory and Applications10.1007/978-3-642-20712-9_31(397-400)Online publication date: 2011
https://doi.org/10.1007/978-3-642-20712-9_31
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Polynomial kernels for weighted problems

Derandomizing polynomial identity tests means proving circuit lower bounds

Average-case complexity theory and polynomial-time reductions

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Polynomial kernels for weighted problems

Derandomizing polynomial identity tests means proving circuit lower bounds

Average-case complexity theory and polynomial-time reductions

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations