The following pages link to (Q4259986):
Displaying 9 items.
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- A note on width-parameterized SAT: an exact machine-model characterization (Q990090) (← links)
- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (Q1401330) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
