Article

Diagonal Circuit Identity Testing and Lower Bounds

Author:

Nitin SaxenaAuthors Info & Claims

ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I

Pages 60 - 71

https://doi.org/10.1007/978-3-540-70575-8_6

Published: 07 July 2008 Publication History

Abstract

No abstract available.

References

[1]

Adleman, L.M., Lenstra, H.W.: Finding irreducible polynomials over finite fields. In: 18th ACM Symposium on Theory of Computing, pp. 350-355. ACM Press, New York (1986)

Digital Library

Google Scholar

[2]

Agrawal, M., Biswas, S.: Primality and identity testing via Chinese remaindering. Journal of the ACM 50(4), 429-443 (2003)

Digital Library

Google Scholar

[3]

Agrawal, M., Kayal, N., Saxena, N.: Primes is in P. Annals of Mathematics 160(2), 781-793 (2004)

Crossref

Google Scholar

[4]

Agrawal, M., Vinay, V.: Arithmetic Circuits: A Chasm at Depth Four (preprint, 2008)

Google Scholar

[5]

Arora, S., Safra, S.: Probabilistic Checking of Proofs: A New Characterization of NP. Journal of the ACM 45(1), 70-122 (1998)

Digital Library

Google Scholar

[6]

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

Crossref

Google Scholar

[7]

Clausen, M., Dress, A., Grabmeier, J., Karpinski, M.: On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields. Theoretical Computer Science 84(2), 151-164 (1991)

Digital Library

Google Scholar

[8]

Dvir, Z., Shpilka, A.: Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits. SIAM J. Comput. 36(5), 1404-1434 (2007)

Digital Library

Google Scholar

[9]

Grigoriev, D., Karpinski, M.: An Exponential Lower Bound for Depth 3 Arithmetic Circuits. In: 30th ACM Symposium on Theory of Computing, pp. 577-582. ACM Press, New York (1998)

Digital Library

Google Scholar

[10]

Grigoriev, D., Razborov, A.A.: Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields. Appl. Algebra Eng. Commun. Comput. 10(6), 465-487 (2000)

Crossref

Google Scholar

[11]

Impagliazzo, R., Kabanets, V.: Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity 13(1/2), 1-46 (2004)

Digital Library

Google Scholar

[12]

Karnin, Z., Shpilka, A.: Deterministic black box polynomial identity testing of depth-3 arithmetic circuits with bounded top fan-in. ECCC Report TR07-042 (2007)

Google Scholar

[13]

Kayal, N.: Private Communication. Summer (2007)

Google Scholar

[14]

Kayal, N., Saxena, N.: Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity 16(2), 115-138 (2007)

Digital Library

Google Scholar

[15]

Lovasz, L.: On determinants, matchings, and random algorithms. In: Fundamentals of Computing Theory, pp. 565-574. Akademia-Verlag (1979)

Google Scholar

[16]

Nisan, N.: Lower bounds for non-commutative computation. In: 23rd ACM Symposium on Theory of Computing, pp. 410-418. ACM Press, New York (1991)

Digital Library

Google Scholar

[17]

Nisan, N., Wigderson, A.: Lower bounds on arithmetic circuits via partial derivatives. Computational Complexity 6(3), 217-234 (1997)

Digital Library

Google Scholar

[18]

Raz, R.: Multi-linear formulas for permanent and determinant are of superpolynomial size. In: 36th ACM Symposium on Theory of Computing, pp. 633-641. ACM Press, New York (2004)

Digital Library

Google Scholar

[19]

Raz, R., Shpilka, A.: Deterministic polynomial identity testing in noncommutative models. Computational Complexity 14(1), 1-19 (2005)

Digital Library

Google Scholar

[20]

Schwartz, J.T.: Fast Probabilistic Algorithms for Verification of Polynomial Identities. Journal of the ACM 27(4), 701-717 (1980)

Digital Library

Google Scholar

[21]

Shamir, A.: IP=PSPACE. Journal of the ACM 39(4), 869-877 (1992)

Digital Library

Google Scholar

[22]

Zippel, R.: Probabilistic Algorithms for Sparse Polynomials. In: International Symposium on Symbolic and Algebraic Computation, pp. 216-226. Springer, Heidelberg (1979)

Digital Library

Google Scholar

Cited By

View all

Hakoniemi TLimaye NTzameret IMohar BShinkar IO'Donnell R(2024)Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and BarriersProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649616(1396-1404)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649616
Bläser MDörfler JIkenmeyer C(2021)On the complexity of evaluating highest weight vectorsProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.29Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2021.29
Dutta PDwivedi PSaxena N(2021)Deterministic identity testing paradigms for bounded top-fanin depth-4 circuitsProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.11Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2021.11
Show More Cited By

Index Terms

Diagonal Circuit Identity Testing and Lower Bounds
1. Mathematics of computing
  1. Probability and statistics
2. Theory of computation
  1. Design and analysis of algorithms

Index terms have been assigned to the content through auto-classification.

Recommendations

Approaching the Chasm at Depth Four

Agrawal and Vinay [2008], Koiran [2012], and Tavenas [2013] have recently shown that an exp (ω(√n log n)) lower bound for depth four homogeneous circuits computing the permanent with bottom layer of × gates having fanin bounded by √n translates to a ...
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing

In this paper we show that lower bounds for bounded depth arithmetic circuits imply derandomization of polynomial identity testing for bounded depth arithmetic circuits. More formally, if there exists an explicit polynomial f(x₁,...,x_m) that cannot be ...
Arithmetic circuits: The chasm at depth four gets wider

In their paper on the ''chasm at depth four'', Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2^o^(^m^) also admit arithmetic circuits of depth four and size 2^o^(^m^). This theorem ...

Comments

Information & Contributors

Information

Published In

ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I

July 2008

892 pages

ISBN:3540705740

Editors:
Luca Aceto
School of Computer Science, Reykjavik University, Reykjavík, Iceland 103
,
Ivan Damgård
Department of Computer Science, IT-Parken, University of Aarhus, ÅrhusN, Denmark 8200
,
Leslie Ann Goldberg
Department of Computer Science, University of Liverpool, Liverpool, UK L69 3BX
,
Magnús M. Halldórsson
School of Computer Science, Reykjavik University, Reykjavik, Iceland 103
,
Anna Ingólfsdóttir
Department of Computer Science, Reykjavik University, Reykjavík, Iceland 103
,
Igor Walukiewicz
Université de Bordeaux-1, LaBRI, Talence cedex, France 33405

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 07 July 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hakoniemi TLimaye NTzameret IMohar BShinkar IO'Donnell R(2024)Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and BarriersProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649616(1396-1404)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649616
Bläser MDörfler JIkenmeyer C(2021)On the complexity of evaluating highest weight vectorsProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.29Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2021.29
Dutta PDwivedi PSaxena N(2021)Deterministic identity testing paradigms for bounded top-fanin depth-4 circuitsProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.11Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2021.11
Balaji NPerifel SShirmohammadi MWorrell JChyzak FLabahn G(2021)Cyclotomic Identity Testing and ApplicationsProceedings of the 2021 International Symposium on Symbolic and Algebraic Computation10.1145/3452143.3465530(35-42)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3452143.3465530
Chaugule PKumar MLimaye NMohapatra CShe ASrinivasan SAceto L(2020)Schur polynomials do not have small formulas if the determinant doesn'tProceedings of the 35th Computational Complexity Conference10.4230/LIPIcs.CCC.2020.14(1-27)Online publication date: 28-Jul-2020
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2020.14
Bhargava VBläser MJindal GPandey AChan T(2019)A deterministic PTAS for the algebraic rank of bounded degree polynomialsProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310476(647-661)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310476
Minahan DVolkovich I(2018)Complete Derandomization of Identity Testing and Reconstruction of Read-Once FormulasACM Transactions on Computation Theory10.1145/319683610:3(1-11)Online publication date: 23-May-2018
https://dl.acm.org/doi/10.1145/3196836
Agrawal MGhosh SSaxena NDiakonikolas IKempe DHenzinger M(2018)Bootstrapping variables in algebraic circuitsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188762(1166-1179)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188762
Minahan DVolkovich I(2017)Complete derandomization of identity testing and reconstruction of read-once formulasProceedings of the 32nd Computational Complexity Conference10.5555/3135595.3135627(1-13)Online publication date: 9-Jul-2017
https://dl.acm.org/doi/10.5555/3135595.3135627
Gupta AKamath PKayal NSaptharishi R(2017)Unexpected power of low-depth arithmetic circuitsCommunications of the ACM10.1145/306547060:6(93-100)Online publication date: 24-May-2017
https://dl.acm.org/doi/10.1145/3065470
Show More Cited By

View Options

View options

Get Access

Login options

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

Abstract

References

Cited By

Index Terms

Recommendations

Approaching the Chasm at Depth Four

Hardness-randomness tradeoffs for bounded depth arithmetic circuits

Arithmetic circuits: The chasm at depth four gets wider

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations