The following pages link to Holger Spakowski (Q693071):
Displayed 23 items.
- Avoiding simplicity is complex (Q693072) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- Generalized juntas and NP-hard sets (Q837194) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- Frequency of correctness versus average polynomial time (Q989533) (← links)
- Exact complexity of the winner problem for Young elections (Q1405784) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
- On the power of unambiguity in alternating machines (Q2642914) (← links)
- On Limited Nondeterminism and ACC Circuit Lower Bounds (Q2798730) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- Hierarchical Unambiguity (Q3642877) (← links)
- (Q4414503) (← links)
- (Q4472458) (← links)
- (Q4673396) (← links)
- (Q4934358) (← links)
- (Q5005153) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191533) (← links)
- On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time (Q5444969) (← links)
- Fundamentals of Computation Theory (Q5492922) (← links)
- Hierarchical Unambiguity (Q5756711) (← links)
- LATIN 2004: Theoretical Informatics (Q5901670) (← links)