The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Iddo Tzameret: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Nachum Dershowitz, Iddo Tzameret
    Complexity of Propositional Proofs Under a Promise. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:291-302 [Conf]
  4. Nachum Dershowitz, Iddo Tzameret
    Complexity of Propositional Proofs under a Promise [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  5. Ran Raz, Iddo Tzameret
    Resolution over Linear Equations and Multilinear Proofs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  6. The Proof Complexity of Polynomial Identities. [Citation Graph (, )][DBLP]


  7. Algebraic Proofs over Noncommutative Formulas. [Citation Graph (, )][DBLP]


  8. Resolution over linear equations and multilinear proofs. [Citation Graph (, )][DBLP]


  9. The Strength of Multilinear Proofs. [Citation Graph (, )][DBLP]


  10. Algebraic Proofs over Noncommutative Formulas [Citation Graph (, )][DBLP]


  11. Resolution over Linear Equations and Multilinear Proofs. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002