Pages that link to "Item:Q5091753"
From MaRDI portal
The following pages link to UG-hardness to NP-hardness by losing half (Q5091753):
Displaying 5 items.
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- (Q6176154) (← links)
- Automated category tree construction: hardness bounds and algorithms (Q6572611) (← links)
- Streaming approximation resistance of every ordering CSP (Q6581871) (← links)
