default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIddo Tzameret
Person information
- affiliation: Imperial College London, UK
- affiliation (former): Royal Holloway, University of London
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Fedor Part, Neil Thapen, Iddo Tzameret:
First-order reasoning and efficient semi-algebraic proofs. Ann. Pure Appl. Log. 176(1): 103496 (2025)- 2024
- [j14]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
:
Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative? SIAM J. Comput. 53(3): 648-700 (2024) - [c18]Iddo Tzameret, Luming Zhang:
Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. ITCS 2024: 95:1-95:22 - [c17]Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret:
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. STOC 2024: 1396-1404 - [i34]Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret:
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [i33]Iddo Tzameret, Luming Zhang:
Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. CoRR abs/2304.14700 (2023) - [i32]Iddo Tzameret, Luming Zhang:
Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c16]Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret:
Simple Hard Instances for Low-Depth Algebraic Proofs. FOCS 2022: 188-199 - [i31]Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret:
Simple Hard Instances for Low-Depth Algebraic Proofs. CoRR abs/2205.07175 (2022) - [i30]Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret:
Simple Hard Instances for Low-Depth Algebraic Proofs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j13]Fedor Part, Iddo Tzameret:
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli. Comput. Complex. 30(1): 2 (2021) - [j12]Iddo Tzameret, Stephen A. Cook:
Uniform, Integral, and Feasible Proofs for the Determinant Identities. J. ACM 68(2): 12:1-12:80 (2021) - [j11]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Theory Comput. 17: 1-88 (2021) - [c15]Fedor Part, Neil Thapen, Iddo Tzameret:
First-Order Reasoning and Efficient Semi-Algebraic Proofs. LICS 2021: 1-13 - [c14]Rahul Santhanam, Iddo Tzameret:
Iterated lower bound formulas: a diagonalization-based approach to proof complexity. STOC 2021: 234-247 - [i29]Fedor Part, Neil Thapen, Iddo Tzameret:
First-Order Reasoning and Efficient Semi-Algebraic Proofs. CoRR abs/2105.07531 (2021) - [i28]Rahul Santhanam, Iddo Tzameret:
Iterated Lower Bound Formulas: A Diagonalization-Based Approach to Proof Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c13]Iddo Tzameret:
From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk). CSL 2020: 5:1-5:2 - [c12]Fedor Part, Iddo Tzameret:
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli. ITCS 2020: 19:1-19:37 - [c11]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? STOC 2020: 54-67
2010 – 2019
- 2019
- [i27]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? CoRR abs/1911.06738 (2019) - [i26]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative? Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j10]Fu Li, Iddo Tzameret:
Witnessing matrix identities and proof complexity. Int. J. Algebra Comput. 28(2): 217-256 (2018) - [j9]Fu Li, Iddo Tzameret, Zhengyu Wang:
Characterizing Propositional Proofs as Noncommutative Formulas. SIAM J. Comput. 47(4): 1424-1462 (2018) - [i25]Fedor Part, Iddo Tzameret:
Resolution with Counting: Lower Bounds over Different Moduli. CoRR abs/1806.09383 (2018) - [i24]Iddo Tzameret, Stephen A. Cook:
Uniform, Integral and Feasible Proofs for the Determinant Identities. CoRR abs/1811.04313 (2018) - [i23]Fedor Part, Iddo Tzameret:
Resolution with Counting: Lower Bounds over Different Moduli. Electron. Colloquium Comput. Complex. TR18 (2018) - [i22]Iddo Tzameret, Stephen A. Cook:
Uniform, Integral and Feasible Proofs for the Determinant Identities. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c10]Iddo Tzameret, Stephen A. Cook:
Uniform, integral and efficient proofs for the determinant identities. LICS 2017: 1-12 - 2016
- [j8]Toniann Pitassi, Iddo Tzameret:
Algebraic proof complexity: progress, frontiers and challenges. ACM SIGLOG News 3(3): 21-43 (2016) - [c9]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CCC 2016: 32:1-32:17 - [i21]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CoRR abs/1606.05050 (2016) - [i20]Toniann Pitassi, Iddo Tzameret:
Algebraic Proof Complexity: Progress, Frontiers and Challenges. CoRR abs/1607.00443 (2016) - [i19]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i18]Toniann Pitassi, Iddo Tzameret:
Algebraic Proof Complexity: Progress, Frontiers and Challenges. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j7]Pavel Hrubes, Iddo Tzameret:
Short Proofs for the Determinant Identities. SIAM J. Comput. 44(2): 340-383 (2015) - [c8]Fu Li, Iddo Tzameret, Zhengyu Wang:
Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs. CCC 2015: 412-432 - [i17]Fu Li, Iddo Tzameret, Zhengyu Wang:
Characterizing Propositional Proofs as Non-Commutative Formulas. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j6]Sebastian Müller, Iddo Tzameret:
Short propositional refutations for dense random 3CNF formulas. Ann. Pure Appl. Log. 165(12): 1864-1918 (2014) - [c7]Iddo Tzameret:
Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem - (Extended Abstract). ICALP (1) 2014: 1015-1026 - [i16]Fu Li, Iddo Tzameret, Zhengyu Wang:
Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs. CoRR abs/1412.8746 (2014) - 2013
- [j5]Eric Allender, George Davie, Luke Friedman, Samuel Hopkins, Iddo Tzameret:
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. Chic. J. Theor. Comput. Sci. 2013 (2013) - [i15]Iddo Tzameret:
On Sparser Random 3SAT Refutation Algorithms and Feasible Interpolation. CoRR abs/1305.0948 (2013) - [i14]Fu Li, Iddo Tzameret:
Generating Matrix Identities and Proof Complexity Lower Bounds. CoRR abs/1312.6242 (2013) - [i13]Fu Li, Iddo Tzameret:
Generating Matrix Identities and Proof Complexity Lower Bounds. Electron. Colloquium Comput. Complex. TR13 (2013) - [i12]Iddo Tzameret:
On Sparser Random 3SAT Refutation Algorithms and Feasible Interpolation. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c6]Sebastian Müller, Iddo Tzameret:
Short Propositional Refutations for Dense Random 3CNF Formulas. LICS 2012: 501-510 - [c5]Pavel Hrubes, Iddo Tzameret:
Short proofs for the determinant identities. STOC 2012: 193-212 - [i11]Eric Allender, George Davie, Luke Friedman, Samuel Hopkins, Iddo Tzameret:
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j4]Iddo Tzameret:
Algebraic proofs over noncommutative formulas. Inf. Comput. 209(10): 1269-1292 (2011) - [i10]Sebastian Müller, Iddo Tzameret:
Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas. CoRR abs/1101.3970 (2011) - [i9]Pavel Hrubes, Iddo Tzameret:
Short Proofs for the Determinant Identities. CoRR abs/1112.6265 (2011) - [i8]Pavel Hrubes, Iddo Tzameret:
Short Proofs for the Determinant Identities. Electron. Colloquium Comput. Complex. TR11 (2011) - [i7]Sebastian Müller, Iddo Tzameret:
Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j3]Nachum Dershowitz, Iddo Tzameret:
Complexity of propositional proofs under a promise. ACM Trans. Comput. Log. 11(3): 18:1-18:30 (2010) - [c4]Iddo Tzameret:
Algebraic Proofs over Noncommutative Formulas. TAMC 2010: 60-71 - [i6]Iddo Tzameret:
Algebraic Proofs over Noncommutative Formulas. CoRR abs/1004.2159 (2010) - [i5]Iddo Tzameret:
Algebraic Proofs over Noncommutative Formulas. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c3]Pavel Hrubes, Iddo Tzameret:
The Proof Complexity of Polynomial Identities. CCC 2009: 41-51 - 2008
- [b1]Iddo Tzameret:
Studies in algebraic and propositional proof complexity. Tel Aviv University, Israel, 2008 - [j2]Ran Raz, Iddo Tzameret:
Resolution over linear equations and multilinear proofs. Ann. Pure Appl. Log. 155(3): 194-224 (2008) - [j1]Ran Raz, Iddo Tzameret:
The Strength of Multilinear Proofs. Comput. Complex. 17(3): 407-457 (2008) - 2007
- [c2]Nachum Dershowitz, Iddo Tzameret:
Complexity of Propositional Proofs Under a Promise. ICALP 2007: 291-302 - [i4]Nachum Dershowitz, Iddo Tzameret:
Complexity of Propositional Proofs under a Promise. CoRR abs/0707.4255 (2007) - [i3]Ran Raz, Iddo Tzameret:
Resolution over Linear Equations and Multilinear Proofs. CoRR abs/0708.1529 (2007) - [i2]Ran Raz, Iddo Tzameret:
Resolution over Linear Equations and Multilinear Proofs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [i1]Ran Raz, Iddo Tzameret:
The Strength of Multilinear Proofs. Electron. Colloquium Comput. Complex. TR06 (2006) - 2003
- [c1]Nachum Dershowitz, Iddo Tzameret:
Gap Embedding for Well-Quasi-Orderings. WoLLIC 2003: 80-90
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 21:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
