Pages that link to "Item:Q3579211"
From MaRDI portal
The following pages link to Relations between average case complexity and approximation complexity (Q3579211):
Displaying 14 items.
- Nearly Optimal NP-Hardness of Unique Coverage (Q5269824) (← links)
- Spectral techniques applied to sparse random graphs (Q5318249) (← links)
- (Q5743407) (← links)
- (Q5743436) (← links)
- On Super Strong ETH (Q5856463) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- Max-3-Lin over non-abelian groups with universal factor graphs (Q6053470) (← links)
- (Q6062142) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
- Reception capacity: definitions, game theory and hardness (Q6536157) (← links)
- Reasoning with propositional logic: from SAT solvers to knowledge compilation (Q6602252) (← links)
- Lossy cryptography from code-based assumptions (Q6652889) (← links)
- A systematic study of sparse LWE (Q6652897) (← links)