Pages that link to "Item:Q1262762"
From MaRDI portal
The following pages link to Strong nondeterministic Turing reduction - a technique for proving intractability (Q1262762):
Displaying 8 items.
- Comparing reductions to NP-complete sets (Q879596) (← links)
- On the strongly generic undecidability of the halting problem (Q884482) (← links)
- Single-exception sorting networks and the computational complexity of optimal sorting network verification (Q3357540) (← links)
- (Q3776605) (← links)
- (Q3780445) (← links)
- (Q4501542) (← links)
- (Q4733404) (← links)
- Strong co-nondeterministic lower bounds for NP cannot be proved feasibly (Q6086996) (← links)