The Surprising Power of Constant Depth Algebraic Proofs

LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science Saarbrücken Germany July, 2020, pp. 591-603, 2020.

Cited by: 2|Bibtex|Views31|DOI:https://doi.org/10.1145/3373718.3394754
EI
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

A major open problem in proof complexity is to prove superpolynomial lower bounds for AC0[p]-Frege proofs. This system is the analog of AC0 [p], the class of bounded depth circuits with prime modular counting gates. Despite strong lower bounds for this class dating back thirty years ([28, 30]), there are no significant lower bounds for AC...More

Code:

Data:

Your rating :
0

 

Tags
Comments