Add to ORKGIn dieser Habilitationsschrift werden Struktur und Eigenschaften von Komplexitätsklassen wie P und NP untersucht, vor allem im Hinblick auf: Zertifikatkomplexität, Einwegfunktionen, Heuristiken gegen NP-Vollständigkeit und Zählkomplexität. Zum letzten Punkt werden speziell untersucht: (a) die Komplexität von Zähleigenschaften von Schaltkreisen, (b) Separationen von Zählklassen mit Immunität und (c) die Komplexität des Zählens der Lösungen von ,,tally`` NP-Problemen
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 “Algebraic Methods in Computational Complexity...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
In dieser Habilitationsschrift werden Struktur und Eigenschaften von Komplexitätsklassen wie P und N...
In dieser Dissertation werden sogenannte ,,promise classes`` studiert, wie z.B. die wichtigen Komple...
This thesis is devoted to the study of computational complexity theory, a branch of theoretical comp...
From November 28 to December 3 2010, the Dagstuhl Seminar 10481 ``Computational Counting\u27\u27 wa...
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 ``Algebraic Methods in Computational Complexit...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
From the 14th of September to the 19th of September, the Dagstuhl Seminar 08381 ``Computational Comp...
From 24.05. to 29.05.2009, the Dagstuhl Seminar 09221 ``Algorithms and Number Theory \u27\u27 was he...
his publication contains abstracts of the 22nd workshop on complexity theory and efficient algorithm...
From 07.10. to 12.10., the Dagstuhl Seminar 07411 ``Algebraic Methods in Computational Complexity\u2...
From 10.10.04 to 15.10.04, the Dagstuhl Seminar 04421 ``Algebraic Methods in Computational Complexi...
This work addresses coercion-resistance in cryptographic voting schemes. It focuses on three particu...
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 “Algebraic Methods in Computational Complexity...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
In dieser Habilitationsschrift werden Struktur und Eigenschaften von Komplexitätsklassen wie P und N...
In dieser Dissertation werden sogenannte ,,promise classes`` studiert, wie z.B. die wichtigen Komple...
This thesis is devoted to the study of computational complexity theory, a branch of theoretical comp...
From November 28 to December 3 2010, the Dagstuhl Seminar 10481 ``Computational Counting\u27\u27 wa...
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 ``Algebraic Methods in Computational Complexit...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
From the 14th of September to the 19th of September, the Dagstuhl Seminar 08381 ``Computational Comp...
From 24.05. to 29.05.2009, the Dagstuhl Seminar 09221 ``Algorithms and Number Theory \u27\u27 was he...
his publication contains abstracts of the 22nd workshop on complexity theory and efficient algorithm...
From 07.10. to 12.10., the Dagstuhl Seminar 07411 ``Algebraic Methods in Computational Complexity\u2...
From 10.10.04 to 15.10.04, the Dagstuhl Seminar 04421 ``Algebraic Methods in Computational Complexi...
This work addresses coercion-resistance in cryptographic voting schemes. It focuses on three particu...
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 “Algebraic Methods in Computational Complexity...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...