Holger Spakowski

Available identifiers

zbMath Open spakowski.holgerMaRDI QIDQ693071

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5005153	2021-08-04	Paper
The robustness of LWPP and WPP, with an application to graph reconstruction	2021-05-25	Paper
On Limited Nondeterminism and ACC Circuit Lower Bounds	2016-04-13	Paper
Avoiding simplicity is complex	2012-12-07	Paper
Frequency of correctness versus average polynomial time	2010-08-20	Paper
An improved exact algorithm for the domatic number problem	2010-01-29	Paper
Hierarchical Unambiguity	2009-11-06	Paper
Generalized juntas and NP-hard sets	2009-09-10	Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science	2009-08-06	Paper
LATIN 2004: Theoretical Informatics	2009-05-07	Paper
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time	2008-02-26	Paper
On the power of unambiguity in alternating machines	2007-09-06	Paper
Hierarchical Unambiguity	2007-09-05	Paper
Fundamentals of Computation Theory	2006-10-20	Paper
LWPP and WPP are not uniformly gap-definable	2006-06-30	Paper
The complexity of Kemeny elections	2006-03-20	Paper
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP	2006-02-22	Paper
Quantum and classical complexity classes: Separations, collapses, and closure properties	2005-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q4673396	2005-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q4472458	2004-08-04	Paper
Exact complexity of the winner problem for Young elections	2003-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q4414503	2003-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4934358	2001-03-12	Paper

Research outcomes over time

This page was built for person: Holger Spakowski