The following pages link to Iddo Tzameret (Q642519):
Displayed 24 items.
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- The strength of multilinear proofs (Q1024659) (← links)
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- (Q2939531) (← links)
- Complexity of propositional proofs under a promise (Q2946606) (← links)
- Algebraic Proofs over Noncommutative Formulas (Q3569064) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- (Q4601840) (← links)
- Witnessing matrix identities and proof complexity (Q4634922) (← links)
- Gap Embedding for Well-Quasi-Orderings (Q4924530) (← links)
- (Q5028363) (← links)
- Uniform, Integral, and Feasible Proofs for the Determinant Identities (Q5056443) (← links)
- (Q5144645) (← links)
- Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? (Q5144897) (← links)
- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Q5167811) (← links)
- Short Proofs for the Determinant Identities (Q5252690) (← links)
- Proof Complexity Lower Bounds from Algebraic Circuit Complexity (Q5368766) (← links)
- (Q5414624) (← links)
- Short proofs for the determinant identities (Q5415475) (← links)
- (Q5874190) (← links)
- (Q5875713) (← links)
- Iterated lower bound formulas: a diagonalization-based approach to proof complexity (Q6086997) (← links)
- Algebraic Proof Complexity: Progress, Frontiers and Challenges (Q6275164) (← links)