Author:
Alekseev Yaroslav,Hirsch Edward A.
Publisher
Springer International Publishing
Reference12 articles.
1. Alekseev, Y.: A lower bound for polynomial calculus with extension rule. In: CCC-2021. Leibniz International Proceedings in Informatics (LIPIcs), vol. 200, pp. 21:1–21:18. Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2021)
2. Alekseev, Y., Grigoriev, D., Hirsch, E.A., Tzameret, I.: Semi-algebraic proofs, IPS lower bounds and the $$\tau $$-conjecture: Can a natural number be negative? In: STOC-2020. pp. 54–67 (2020). Technical details can be found in ECCC TR19-142
3. Buss, S.R.: Polynomial size proofs of the propositional pigeonhole principle. J. Symb. Log. 52(4), 916–927 (1987)
4. Clegg, M., Edmonds, J., Impagliazzo, R.: Using the Groebner basis algorithm to find proofs of unsatisfiability. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), pp. 174–183. ACM (1996)
5. Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symb. Log. 44(1), 36–50 (1979)