scientific article; zbMATH DE number 6829271

DOI10.4230/LIPICS.CCC.2015.72MaRDI QIDQ4601823zbMATH OpenFDO

Authors Abhishek Bhowmick, Shachar Lovett

Publication date 24 January 2018

Full work available at URL https://arxiv.org/abs/1412.4719

zbMATH Keywords

barrierlower boundsnonclassical polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Quantum lower bounds by polynomials
• scientific article; zbMATH DE number 2174386
• Polynomials, quantum query complexity, and Grothendieck's inequality
• scientific article; zbMATH DE number 4125799
• scientific article; zbMATH DE number 4008825
• Non-classical polynomials and the inverse theorem
• Non-commutative computations: lower bounds and polynomial identity testing
• Lower bounds for non-classical eigenvalue problems
• Frobenius nonclassicality with respect to linear systems of curves of arbitrary degree
• Lower bounds for the complexity of polynomials

Cited in

(1)

• Torus polynomials: an algebraic approach to ACC lower bounds

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601823)