|
Search the dblp DataBase
Iddo Tzameret:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ran Raz, Iddo Tzameret
The Strength of Multilinear Proofs [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:001, pp:- [Journal]
- Nachum Dershowitz, Iddo Tzameret
Gap Embedding for Well-Quasi-Orderings. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2003, v:84, n:, pp:- [Journal]
- Nachum Dershowitz, Iddo Tzameret
Complexity of Propositional Proofs Under a Promise. [Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:291-302 [Conf]
- Nachum Dershowitz, Iddo Tzameret
Complexity of Propositional Proofs under a Promise [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Ran Raz, Iddo Tzameret
Resolution over Linear Equations and Multilinear Proofs [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
The Proof Complexity of Polynomial Identities. [Citation Graph (, )][DBLP]
Algebraic Proofs over Noncommutative Formulas. [Citation Graph (, )][DBLP]
Resolution over linear equations and multilinear proofs. [Citation Graph (, )][DBLP]
The Strength of Multilinear Proofs. [Citation Graph (, )][DBLP]
Algebraic Proofs over Noncommutative Formulas [Citation Graph (, )][DBLP]
Resolution over Linear Equations and Multilinear Proofs. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|