Efficient Proofs and Computation: A Unified Algebraic Approach

Project Information

EPRICOT

Grant agreement ID: 101002742

DOI

10.3030/101002742

EC signature date 13 April 2021

Start date 1 July 2021

End date 30 June 2026

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 899 675,00

EU contribution

€ 1 899 675,00

Coordinated by

IMPERIAL COLLEGE OF SCIENCE TECHNOLOGY AND MEDICINE
United Kingdom

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Peer reviewed articles (3)

Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative?

Author(s): Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
Published in: SIAM Journal on Computing, 2024, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics

Iterated Lower Bound Formulas: A Diagonalization-Based Approach to Proof Complexity

Author(s): Rahul Santhanam, Iddo Tzameret
Published in: SIAM Journal on Computing, Issue (Invited; Under 2n round review), 2024, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics

First-Order Reasoning and Efficient Semi-Algebraic Proofs

Author(s): Fedor Part, Neil Thapen, Iddo Tzameret
Published in: Annals of Pure and Applied Logic, Issue (Under second round of review; conditional acceptance), 2024, ISSN 1873-2461
Publisher: Elsevier

Conference proceedings (4)

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers

Author(s): Tuomas Hakoniemi, Nutan Limaye and Iddo Tzameret
Published in: 56th Annual ACM Symposium on Theory of Computing (STOC) 2024, Issue (To appear), 2024
Publisher: ACM

Lower bounds for regular resolution over parities

Author(s): Klim Efremenko, Michal Garlik, Dmitry Itsykson
Published in: Proceedings of the 56th Annual ACM SIGACT Symposium on Theory of Computing (STOC) 2024, Issue (To appear), 2024
Publisher: ACM

Simple Hard Instances for Low-Depth Algebraic Proofs

Author(s): Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret
Published in: IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) 2022, 2022, ISBN 978-1-6654-5519-0
Publisher: IEEE
DOI: 10.1109/focs54457.2022.00025

Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness

Author(s): Tzameret, Iddo; Zhang, Lu-Ming
Published in: 15th Innovations in Theoretical Computer Science Conference (ITCS), 2024., 2024, ISBN 9783959773096
Publisher: Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
DOI: 10.48550/arxiv.2304.14700

Other (2)

Constructive proof of Schwartz-Zippel lemma and applications

Author(s): Albert Atserias, Iddo Tzameret
Published in: 2024
Publisher: Not published yet

Bounded Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions

Author(s): Svyatoslav Gryaznov, Navid Talebanfard
Published in: 2024
Publisher: Computational Complexity Foundation (CCF) (under review)