Pages that link to "Item:Q290182"
From MaRDI portal
The following pages link to NP-hard sets are superterse unless NP is small (Q290182):
Displaying 7 items.
- The size of SPP (Q596117) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Some structural properties of SAT (Q1587336) (← links)
- Approximable sets (Q1898468) (← links)
- Structural analysis of the complexity of inverse functions (Q4032932) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311112) (← links)