Pages that link to "Item:Q5919233"
From MaRDI portal
The following pages link to Every 2-CSP allows nontrivial approximation (Q5919233):
Displaying 7 items.
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- On bounded occurrence constraint satisfaction (Q1607037) (← links)
- 2 CSPs all are approximable within a constant differential factor (Q1661912) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- Every 2-CSP allows nontrivial approximation (Q5901103) (← links)