Iterated lower bound formulas: a diagonalization-based approach to proof complexity

DOI10.1145/3406325.3451010OpenAlexW3172953073MaRDI QIDQ6086997

Iddo Tzameret, Rahul Santhanam

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10044/1/93966

zbMATH Keywords

diagonalizationalgebraic complexitycircuit complexity lower boundsideal proof systemiterated lower bound formulasproof complexity lower bounds

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Iterated lower bound formulas: a diagonalization-based approach to proof complexity