Iddo Tzameret - RankMe

77 papers A* 10A 6B 1C 2Journal 56Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	AC⁰[p]-Frege Cannot Efficiently Prove That Constant-Depth Algebraic Circuit Lower Bounds Are Hard. ITCS Jiaqi Lu, Rahul Santhanam, Iddo Tzameret
2025	J	`jnl`	AC CoRR Jiaqi Lu, Rahul Santhanam, Iddo Tzameret
2025	J	`jnl`	AC Electron. Colloquium Comput. Complex. Jiaqi Lu, Rahul Santhanam, Iddo Tzameret
2025	A*	`conf`	Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets. STOC Albert Atserias, Iddo Tzameret
2025	J	`jnl`	First-order reasoning and efficient semi-algebraic proofs. Ann. Pure Appl. Log. Fedor Part, Neil Thapen, Iddo Tzameret
2025	J	`jnl`	Lower Bounds against the Ideal Proof System in Finite Fields. CoRR Tal Elbaz, Nashlen Govindasamy, Jiaqi Lu, Iddo Tzameret
2025	J	`jnl`	Lower Bounds against the Ideal Proof System in Finite Fields. Electron. Colloquium Comput. Complex. Tal Elbaz, Nashlen Govindasamy, Jiaqi Lu, Iddo Tzameret
2024	J	`jnl`	Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets. CoRR Albert Atserias, Iddo Tzameret
2024	J	`jnl`	Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets. Electron. Colloquium Comput. Complex. Albert Atserias, Iddo Tzameret
2024	A*	`conf`	Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. STOC Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret
2024	J	`jnl`	Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. CoRR Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret
2024	J	`jnl`	Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. Electron. Colloquium Comput. Complex. Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret
2024	J	`jnl`	Semialgebraic Proofs, IPS Lower Bounds, and the $\boldsymbol{\tau}$-Conjecture: Can a Natural Number be Negative? SIAM J. Comput. Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2024	A	`conf`	Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. ITCS Iddo Tzameret, Luming Zhang
2023	J	`jnl`	Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. CoRR Iddo Tzameret, Luming Zhang
2023	J	`jnl`	Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. Electron. Colloquium Comput. Complex. Iddo Tzameret, Luming Zhang
2022	A*	`conf`	Simple Hard Instances for Low-Depth Algebraic Proofs. FOCS Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret
2022	J	`jnl`	Simple Hard Instances for Low-Depth Algebraic Proofs. CoRR Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret
2022	J	`jnl`	Simple Hard Instances for Low-Depth Algebraic Proofs. Electron. Colloquium Comput. Complex. Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret
2021	A*	`conf`	First-Order Reasoning and Efficient Semi-Algebraic Proofs. LICS Fedor Part, Neil Thapen, Iddo Tzameret
2021	J	`jnl`	First-Order Reasoning and Efficient Semi-Algebraic Proofs. CoRR Fedor Part, Neil Thapen, Iddo Tzameret
2021	J	`jnl`	Iterated Lower Bound Formulas: A Diagonalization-Based Approach to Proof Complexity. Electron. Colloquium Comput. Complex. Rahul Santhanam, Iddo Tzameret
2021	A*	`conf`	Iterated lower bound formulas: a diagonalization-based approach to proof complexity. STOC Rahul Santhanam, Iddo Tzameret
2021	J	`jnl`	Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Theory Comput. Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
2021	J	`jnl`	Resolution with Counting: Dag-Like Lower Bounds and Different Moduli. Comput. Complex. Fedor Part, Iddo Tzameret
2021	J	`jnl`	Uniform, Integral, and Feasible Proofs for the Determinant Identities. J. ACM Iddo Tzameret, Stephen A. Cook
2020	B	`conf`	From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk). CSL Iddo Tzameret
2020	A	`conf`	Resolution with Counting: Dag-Like Lower Bounds and Different Moduli. ITCS Fedor Part, Iddo Tzameret
2020	A*	`conf`	Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? STOC Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2019	J	`jnl`	Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative? Electron. Colloquium Comput. Complex. Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2019	J	`jnl`	Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? CoRR Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
2018	J	`jnl`	Characterizing Propositional Proofs as Noncommutative Formulas. SIAM J. Comput. Fu Li, Iddo Tzameret, Zhengyu Wang
2018	J	`jnl`	Resolution with Counting: Lower Bounds over Different Moduli. CoRR Fedor Part, Iddo Tzameret
2018	J	`jnl`	Resolution with Counting: Lower Bounds over Different Moduli. Electron. Colloquium Comput. Complex. Fedor Part, Iddo Tzameret
2018	J	`jnl`	Uniform, Integral and Feasible Proofs for the Determinant Identities. CoRR Iddo Tzameret, Stephen A. Cook
2018	J	`jnl`	Uniform, Integral and Feasible Proofs for the Determinant Identities. Electron. Colloquium Comput. Complex. Iddo Tzameret, Stephen A. Cook
2018	J	`jnl`	Witnessing matrix identities and proof complexity. Int. J. Algebra Comput. Fu Li, Iddo Tzameret
2017	A*	`conf`	Uniform, integral and efficient proofs for the determinant identities. LICS Iddo Tzameret, Stephen A. Cook
2016	J	`jnl`	Algebraic Proof Complexity: Progress, Frontiers and Challenges. CoRR Toniann Pitassi, Iddo Tzameret
2016	J	`jnl`	Algebraic Proof Complexity: Progress, Frontiers and Challenges. Electron. Colloquium Comput. Complex. Toniann Pitassi, Iddo Tzameret
2016	J	`jnl`	Algebraic proof complexity: progress, frontiers and challenges. ACM SIGLOG News Toniann Pitassi, Iddo Tzameret
2016	A	`conf`	Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CCC Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
2016	J	`jnl`	Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CoRR Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
2016	J	`jnl`	Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Electron. Colloquium Comput. Complex. Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
2015	J	`jnl`	Characterizing Propositional Proofs as Non-Commutative Formulas. Electron. Colloquium Comput. Complex. Fu Li, Iddo Tzameret, Zhengyu Wang
2015	A	`conf`	Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs. CCC Fu Li, Iddo Tzameret, Zhengyu Wang
2015	J	`jnl`	Short Proofs for the Determinant Identities. SIAM J. Comput. Pavel Hrubes, Iddo Tzameret
2014	J	`jnl`	Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs. CoRR Fu Li, Iddo Tzameret, Zhengyu Wang
2014	J	`jnl`	Short propositional refutations for dense random 3CNF formulas. Ann. Pure Appl. Log. Sebastian Müller, Iddo Tzameret
2014	—	`conf`	Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem - (Extended Abstract). ICALP (1) Iddo Tzameret
2013	J	`jnl`	Generating Matrix Identities and Proof Complexity Lower Bounds. CoRR Fu Li, Iddo Tzameret
2013	J	`jnl`	Generating Matrix Identities and Proof Complexity Lower Bounds. Electron. Colloquium Comput. Complex. Fu Li, Iddo Tzameret
2013	J	`jnl`	Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. Chic. J. Theor. Comput. Sci. Eric Allender, George Davie, Luke Friedman, Samuel B. Hopkins, Iddo Tzameret
2013	J	`jnl`	On Sparser Random 3SAT Refutation Algorithms and Feasible Interpolation CoRR Iddo Tzameret
2013	J	`jnl`	On Sparser Random 3SAT Refutation Algorithms and Feasible Interpolation. Electron. Colloquium Comput. Complex. Iddo Tzameret
2012	J	`jnl`	Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. Electron. Colloquium Comput. Complex. Eric Allender, George Davie, Luke Friedman, Samuel B. Hopkins, Iddo Tzameret
2012	A*	`conf`	Short Propositional Refutations for Dense Random 3CNF Formulas. LICS Sebastian Müller, Iddo Tzameret
2012	A*	`conf`	Short proofs for the determinant identities. STOC Pavel Hrubes, Iddo Tzameret
2011	J	`jnl`	Algebraic proofs over noncommutative formulas. Inf. Comput. Iddo Tzameret
2011	J	`jnl`	Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas CoRR Sebastian Müller, Iddo Tzameret
2011	J	`jnl`	Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas. Electron. Colloquium Comput. Complex. Sebastian Müller, Iddo Tzameret
2011	J	`jnl`	Short Proofs for the Determinant Identities CoRR Pavel Hrubes, Iddo Tzameret
2011	J	`jnl`	Short Proofs for the Determinant Identities. Electron. Colloquium Comput. Complex. Pavel Hrubes, Iddo Tzameret
2010	J	`jnl`	Algebraic Proofs over Noncommutative Formulas CoRR Iddo Tzameret
2010	C	`conf`	Algebraic Proofs over Noncommutative Formulas. TAMC Iddo Tzameret
2010	J	`jnl`	Algebraic Proofs over Noncommutative Formulas. Electron. Colloquium Comput. Complex. Iddo Tzameret
2010	J	`jnl`	Complexity of propositional proofs under a promise. ACM Trans. Comput. Log. Nachum Dershowitz, Iddo Tzameret
2009	A	`conf`	The Proof Complexity of Polynomial Identities. CCC Pavel Hrubes, Iddo Tzameret
2008	J	`jnl`	Resolution over linear equations and multilinear proofs. Ann. Pure Appl. Log. Ran Raz, Iddo Tzameret
2008	—	`—`	Studies in algebraic and propositional proof complexity Iddo Tzameret
2008	J	`jnl`	The Strength of Multilinear Proofs. Comput. Complex. Ran Raz, Iddo Tzameret
2007	A*	`conf`	Complexity of Propositional Proofs Under a Promise. ICALP Nachum Dershowitz, Iddo Tzameret
2007	J	`jnl`	Complexity of Propositional Proofs under a Promise CoRR Nachum Dershowitz, Iddo Tzameret
2007	J	`jnl`	Resolution over Linear Equations and Multilinear Proofs CoRR Ran Raz, Iddo Tzameret
2007	J	`jnl`	Resolution over Linear Equations and Multilinear Proofs. Electron. Colloquium Comput. Complex. Ran Raz, Iddo Tzameret
2006	J	`jnl`	The Strength of Multilinear Proofs Electron. Colloquium Comput. Complex. Ran Raz, Iddo Tzameret
2003	C	`conf`	Gap Embedding for Well-Quasi-Orderings. WoLLIC Nachum Dershowitz, Iddo Tzameret