#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2002

2018

- This year (2)
- Last 5 years (16)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ran Raz, Iddo Tzameret
- Electronic Colloquium on Computational Complexity
- 2007

We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead of clauses. Weâ€¦ (More)

- Pavel Hrubes, Iddo Tzameret
- Electronic Colloquium on Computational Complexity
- 2011

We study arithmetic proof systems P<sub>c</sub>(F) and P<sub>f</sub>(F) operating with arithmetic circuits and arithmetic formulas, respectively, that prove polynomial identities over a field F. Weâ€¦ (More)

- Ran Raz, Iddo Tzameret
- computational complexity
- 2006

We introduce an algebraic proof system that manipulates multilinear arithmetic formulas. We show that this proof system is fairly strong, even when restricted to multilinear arithmetic formulas of aâ€¦ (More)

- Pavel Hrubes, Iddo Tzameret
- 2009 24th Annual IEEE Conference on Computationalâ€¦
- 2009

Devising an efficient deterministic -- or even a non-deterministic sub-exponential time -- algorithm for testing polynomial identities is a fundamental problem in algebraic complexity and complexityâ€¦ (More)

- Iddo Tzameret
- Electronic Colloquium on Computational Complexity
- 2010

We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least as strong as Frege,â€¦ (More)

- Sebastian MÃ¼ller, Iddo Tzameret
- 2012 27th Annual IEEE Symposium on Logic inâ€¦
- 2012

Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proofâ€¦ (More)

- Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson
- Conference on Computational Complexity
- 2016

We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi [23], where the circuits comprising theâ€¦ (More)

- Fu Li, Iddo Tzameret
- 2013

Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard instances for strong proof systems. A matrix identity of d Ã— d matricesâ€¦ (More)

- Nachum Dershowitz, Iddo Tzameret
- ICALP
- 2007

We studyâ€”within the framework of propositional proof complexityâ€”the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has many satisfyingâ€¦ (More)

- Fu Li, Iddo Tzameret, Zhengyu Wang
- Conference on Computational Complexity
- 2015

Does every Boolean tautology have a short propositional-calculus proof? Here, a propositionalcalculus (i.e. Frege) proof is any proof starting from a set of axioms and deriving new Boolean formulasâ€¦ (More)