Pages that link to "Item:Q1262762"

The following pages link to Strong nondeterministic Turing reduction - a technique for proving intractability (Q1262762):

Displaying 2 items.

• Comparing reductions to NP-complete sets (Q879596) (← links)
• Single-exception sorting networks and the computational complexity of optimal sorting network verification (Q3357540) (← links)