Pages that link to "Item:Q1775885"
From MaRDI portal
The following pages link to Competing provers yield improved Karp-Lipton collapse results (Q1775885):
Displaying 12 items.
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Proof systems that take advice (Q553297) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- The 1-versus-2 queries problem revisited (Q970102) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- Pseudo-deterministic Proofs (Q4993280) (← links)
