Resolution with Counting: Dag-Like Lower Bounds and Different Moduli-Reference-Cited by-同舟云学术

Resolution with Counting: Dag-Like Lower Bounds and Different Moduli

Published:2021-01-08 Issue:1 Volume:30 Page:
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Part Fedor,Tzameret Iddo

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00037-020-00202-x.pdf

Reference33 articles.

1. Miklós Ajtai (1988). The complexity of the pigeonhole principle. In Proceedings of the IEEE 29th Annual Symposium on Foundations of Computer Science, 346–355

2. Michael Alekhnovich & Alexander A. Razborov (2001). Lower bounds for polynomial calculus: non-binomial case. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001), 190–199. IEEE Computer Soc., Los Alamitos, CA

3. Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch & Iddo Tzameret (2020). Semi-Algebraic Proofs, IPS Lower Bounds and the $$\tau$$-Conjecture: Can a Natural Number be Negative? STOC 2020

4. Noga Alon & Zoltán Füredi (1993). Covering the Cube by Affine Hyperplanes. Eur. J. Comb. 14(2), 79–83. ISSN 0195-6698. URL http://dx.doi.org/10.1006/eujc.1993.1011

5. Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi & Robert Robere (2018). Stabbing Planes. In 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA, Anna R. Karlin, editor, volume 94 of LIPIcs, 10:1–10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL https://doi.org/10.4230/LIPIcs.ITCS.2018.10

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space;ACM Transactions on Computation Theory;2024-09-09

2. Lower Bounds for Regular Resolution over Parities;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Semialgebraic Proofs, IPS Lower Bounds, and the $\boldsymbol{\tau}$-Conjecture: Can a Natural Number be Negative?;SIAM Journal on Computing;2024-06-05

4. A Lower Bound for Essential Covers of the Cube;Combinatorica;2024-04-23

5. Depth lower bounds in Stabbing Planes for combinatorial principles;Logical Methods in Computer Science;2024-01-11