Humboldt-Universität zu Berlin - Mathematisch-Naturwissenschaftliche Fakultät - Komplexität und Kryptografie

Ausgewählte Vorträge von Olaf Beyersdorff

Nondeterministic instance complexity and proof systems with advice
3rd International Conference on Language and Automata Theory and Applications (LATA), Tarragona (Spain), April 2009.

A tight Karp-Lipton collapse result in bounded arithmetic
17th EACSL Conference on Computer Science Logic (CSL), Bertinoro (Italy), September 2008.

Logical closure properties of propositional proof systems
5th Conference on Theory and Applications of Models of Computation (TAMC), Xi'an (China), April 2008.

The Deduction Theorem, Optimal Proof Systems, and Complete Disjoint NP-Pairs
3rd Conference on Computability in Europe (CiE)
, Siena (Italien), Juni 2007.

Disjunkte NP-Paare und aussagenlogische Beweissysteme
Vortrag zur Verteidigung der Dissertation,
Humboldt-Universität zu Berlin, Juli 2006.

Tuples of Disjoint NP-Sets
1st International Computer Science Symposium in Russia (CSR)
, St.Petersburg (Russland), Juni 2006.

Disjoint NP Pairs from propositional proof systems
3rd Conference on Theory and Applications of Models of Computation (TAMC)
, Peking (China), Mai 2006.

Representable Disjoint NP-Pairs
24th Conference on Foundations of Software Technology & Theoretical Computer Science (FST&TCS), Chennai (Indien), Dezember 2004.