Erfan Khaniki
Abstract
The proof system
(1) | We prove almost quadratic lower bounds for
| ||||||||||||||||||||||
(2) | We also prove super-polynomial (more than nk for any fixed k) and also exponential (2nϵ for an ϵ > 0) lower bounds for tree-like
| ||||||||||||||||||||||
- [1] . 1994. The complexity of the pigeonhole principle. Combinatorica 14, 4 (1994), 417–433.
Google Scholar 
Cross Ref
- [2] . 1994. The independence of the modulo p counting principles. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC’94). 402–411.Google ScholarDigital Library
- [3] . 2001. Lower bounds for polynomial calculus: Non-Binomial case. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS’01). 190–199.Google ScholarCross Ref
- [4] . 1994. Lower bounds on Hilbert’s Nullstellensatz and propositional proofs. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS’94). 794–806.Google ScholarDigital Library
- [5] . 1999. Short proofs are narrow—Resolution made simple. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC’99). 517–526.Google Scholar
- [6] . 2001. Linear gaps between degrees for the polynomial calculus modulo distinct primes. J. Comput. System Sci. 62, 2 (2001), 267–289.Google ScholarDigital Library
- [7] . 1988. Many hard examples for resolution. J. ACM 35, 4 (
Oct. 1988), 759–768.Google ScholarDigital Library - [8] . 1996. Using the Groebner basis algorithm to find proofs of unsatisfiability. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC’96). 174–183.Google ScholarDigital Library
- [9] . 2018. Some subsystems of constant-depth Frege with parity. ACM Trans. Comput. Logic 19, 4 (
Nov. 2018).Google ScholarDigital Library - [10] . 2019. Notes on resolution over linear equations. In Proceedings of the Conference on Computer Science—Theory and Applications (CSR’19). 168–179.Google ScholarDigital Library
- [11] . 2020. Resolution over linear equations modulo two. Ann. Pure Appl. Logic 171, 1 (2020).
Google Scholar Cross Ref - [12] . 2019. Proof Complexity.
Encyclopedia of Mathematics and Its Applications , Vol. 170. Cambridge University Press.Google ScholarCross Ref - [13] . 2018. On monotone circuits with local oracles and clique lower bounds. Chic. J. Theor. Comput. Sci. (2018).Google ScholarCross Ref
- [14] . 1995. An exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle. Random Struct. Algor. 7, 1 (1995), 15–40.
Google Scholar Digital Library - [15] . 1997. Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus. In Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS’97). 85–90.Google ScholarCross Ref
- [16] . 2018. Randomized feasible interpolation and monotone circuits with a local oracle. J. Math. Logic 18, 2 (2018).Google ScholarCross Ref
- [17] . 1988. Ramanujan graphs. Combinatorica 8, 3 (1988), 261–277.Google ScholarCross Ref
- [18] . 2020. Resolution with counting: Dag-Like lower bounds and different moduli. In Proceedings of the 11th Innovations in Theoretical Computer Science Conference (ITCS’20), Vol. 151. 1–37.Google Scholar
- [19] . 1993. Exponential lower bounds for the pigeonhole principle. Comput. Complex. 3 (1993), 97–140.
Google Scholar Digital Library - [20] . 2000. A lower bound for DLL algorithms for k-SAT (Preliminary Version). In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’00). 128–136.Google Scholar
- [21] . 2008. Resolution over linear equations and multilinear proofs. Ann. Pure Appl. Logic 155, 3 (2008), 194–224.Google ScholarCross Ref
- [22] . 1998. Lower bounds for the polynomial calculus. Comput. Complex. 7, 4 (
Dec. 1998), 291–324.Google ScholarDigital Library - [23] . 1997. Count(q) does not imply Count(p). Ann. Pure Appl. Logic 90, 1 (1997), 1–56.Google ScholarCross Ref
- [24] . 2014. Sparser random 3-SAT refutation algorithms and the interpolation problem. In Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP’14). 1015–1026.Google ScholarCross Ref
Index Terms
- On Proof Complexity of Resolution over Polynomial Calculus
Recommendations
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli
AbstractResolution over linear equations is a natural extension of the popular resolution refutation system, augmented with the ability to carry out basic counting. Denoted , this refutation system operates with disjunctions of linear equations with ...
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer ScienceWe prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential separation between tree-like and dag-like proofs for both Cutting Planes and ...
Space Complexity in Polynomial Calculus
During the last 10 to 15 years, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for proofs. Besides being a natural complexity measure of intrinsic interest, space is also an important concern in ...
Comments