Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Iddo Tzameret" ( http://dblp.L3S.de/Authors/Iddo_Tzameret )

  Author page on DBLP  Author page in RDF  Community of Iddo Tzameret in ASPL-2

Publication years (Num. hits)
2003-2011 (18) 2012 (2)
Publication types (Num. hits)
article(16) inproceedings(4)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(6) CoRR(5) ACM Trans. Comput. Log.(1) Ann. Pure Appl. Logic(1) Computational Complexity(1) Electr. Notes Theor. Comput. S...(1) ICALP(1) IEEE Conference on Computation...(1) Inf. Comput.(1) STOC(1) TAMC(1)
Authors
Iddo Tzameret(20) Ran Raz(5) Nachum Dershowitz(4) Pavel Hrubes(4) Sebastian Müller(2) Eric Allender(1) George Davie(1) Luke Friedman(1) Samuel Hopkins(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords
Results
Found 20 publication records. Showing 20 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Eric Allender, George Davie, Luke Friedman, Samuel Hopkins, Iddo Tzameret Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Pavel Hrubes, Iddo Tzameret Short proofs for the determinant identities. Search on Bibsonomy STOC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sebastian Müller, Iddo Tzameret Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Pavel Hrubes, Iddo Tzameret Short Proofs for the Determinant Identities. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Iddo Tzameret Algebraic proofs over noncommutative formulas. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sebastian Müller, Iddo Tzameret Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Pavel Hrubes, Iddo Tzameret Short Proofs for the Determinant Identities Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Iddo Tzameret Algebraic Proofs over Noncommutative Formulas. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Iddo Tzameret Algebraic Proofs over Noncommutative Formulas Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Nachum Dershowitz, Iddo Tzameret Complexity of propositional proofs under a promise. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Iddo Tzameret Algebraic Proofs over Noncommutative Formulas. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pavel Hrubes, Iddo Tzameret The Proof Complexity of Polynomial Identities. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ran Raz, Iddo Tzameret Resolution over linear equations and multilinear proofs. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ran Raz, Iddo Tzameret The Strength of Multilinear Proofs. Search on Bibsonomy Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Subject classification. 03F20, 68Q17, 13P10
1Ran Raz, Iddo Tzameret Resolution over Linear Equations and Multilinear Proofs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Nachum Dershowitz, Iddo Tzameret Complexity of Propositional Proofs under a Promise Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Ran Raz, Iddo Tzameret Resolution over Linear Equations and Multilinear Proofs Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Nachum Dershowitz, Iddo Tzameret Complexity of Propositional Proofs Under a Promise. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF random 3CNF, promise problems, resolution, proof complexity
1Ran Raz, Iddo Tzameret The Strength of Multilinear Proofs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Nachum Dershowitz, Iddo Tzameret Gap Embedding for Well-Quasi-Orderings. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #20 of 20 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.