The following pages link to (Q4256650):
Displaying 14 items.
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- (Q4218113) (← links)
- (Q5092470) (← links)
- (Q5121895) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311112) (← links)
- Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (Q5892607) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
