Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Olaf Beyersdorff" ( http://dblp.L3S.de/Authors/Olaf_Beyersdorff )

  Author page on DBLP  Author page in RDF  Community of Olaf Beyersdorff in ASPL-2

Publication years (Num. hits)
2004-2008 (16) 2009-2010 (22) 2011 (7)
Publication types (Num. hits)
article(25) inproceedings(19) phdthesis(1)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(10) SAT(4) TAMC(4) Arch. Math. Log.(2) CoRR(2) CSR(2) FSTTCS(2) Inf. Process. Lett.(2) Math. Log. Q.(2) Theor. Comput. Sci.(2) Theory Comput. Syst.(2) ACM Trans. Comput. Log.(1) ATMOS(1) CSL(1) ICALP(1) Inf. Comput.(1) More (+10 of total 21)
Authors
Olaf Beyersdorff(45) Sebastian Müller(10) Heribert Vollmer(9) Michael Thomas(9) Arne Meier(8) Massimo Lauria(6) Nicola Galesi(6) Johannes Köbler(5) Zenon Sadowski(3) Alexander A. Razborov(2) Martin Mundhenk(2) Thomas Schneider 0002(2) Gido Scharfenberger-Fabian(1) Jochen Messner(1) Karteek Sreenivasaiah(1) Meena Mahajan(1) More (+10 of total 18)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords
Results
Found 45 publication records. Showing 45 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Olaf Beyersdorff, Zenon Sadowski Do there exist complete sets for promise classes? Search on Bibsonomy Math. Log. Q. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Johannes Köbler, Sebastian Müller Proof systems that take advice. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Heribert Vollmer Model Checking CTL is Almost Always Inherently Sequential Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer Proof complexity of propositional default logic. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov Parameterized Bounded-Depth Frege Is Not Optimal. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria Parameterized Complexity of DPLL Search Procedures. Search on Bibsonomy SAT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer Verifying Proofs in Constant Depth. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov Parameterized Bounded-Depth Frege is Not Optimal. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Nicola Galesi, Massimo Lauria Hardness of Parameterized Resolution. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Olaf Beyersdorff The Deduction Theorem for Strong Propositional Proof Systems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Sebastian Müller A tight Karp-Lipton collapse result in bounded arithmetic. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Sebastian Müller Different Approaches to Proof Systems. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff Proof Complexity of Non-classical Logics. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer Proof Complexity of Propositional Default Logic. Search on Bibsonomy SAT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff On the correspondence between arithmetic theories and propositional proof systems - a survey. Search on Bibsonomy Math. Log. Q. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer The complexity of propositional implication. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Johannes Köbler, Sebastian Müller Proof Systems that Take Advice. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Zenon Sadowski Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Johannes Köbler, Jochen Messner Nondeterministic functions and the existence of optimal proof systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff Comparing axiomatizations of free pseudospaces. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Zenon Sadowski Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider 0002 Model Checking CTL is Almost Always Inherently Sequential. Search on Bibsonomy TIME The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Model checking, complexity, temporal logic
1Olaf Beyersdorff, Yevgen Nebesov Edges as Nodes - a New Approach to Timetable Information . Search on Bibsonomy ATMOS The full citation details ... 2009 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Johannes Köbler, Sebastian Müller Nondeterministic Instance Complexity and Proof Systems with Advice. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer The Complexity of Reasoning for Fragments of Default Logic. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Sebastian Müller Does Advice Help to Prove Propositional Tautologies? Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff On the Existence of Complete Disjoint NP-Pairs. Search on Bibsonomy SYNASC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Johannes Köbler, Sebastian Müller Nondeterministic Instance Complexity and Proof Systems with Advice. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer The Complexity of Propositional Implication Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer The Complexity of Reasoning for Fragments of Default Logic Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Olaf Beyersdorff Tuples of Disjoint NP-Sets. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Propositional proof systems, Disjoint -pairs
1Olaf Beyersdorff Logical Closure Properties of Propositional Proof Systems. Search on Bibsonomy TAMC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Sebastian Müller A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. Search on Bibsonomy CSL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Karp-Lipton Theorem, Optimal Propositional Proof Systems, Extended Frege, Bounded Arithmetic, Advice
1Olaf Beyersdorff Classes of representable disjoint NP-pairs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff The Deduction Theorem for Strong Propositional Proof Systems. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff Disjoint NP-pairs and propositional proof systems. Search on Bibsonomy 2006   RDF
1Olaf Beyersdorff On the Deduction Theorem and Complete Disjoint NP-Pairs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Olaf Beyersdorff Tuples of Disjoint NP-Sets. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff Disjoint NP-Pairs from Propositional Proof Systems. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff Disjoint NP-Pairs from Propositional Proof Systems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Olaf Beyersdorff Tuples of Disjoint NP-Sets Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Olaf Beyersdorff Representable Disjoint NP-Pairs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Olaf Beyersdorff Representable Disjoint NP-Pairs. Search on Bibsonomy FSTTCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #45 of 45 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.