Pages that link to "Item:Q5172744"
From MaRDI portal
The following pages link to Conditional hardness for satisfiable 3-CSPs (Q5172744):
Displaying 11 items.
- Approximating satisfiable satisfiability problems (extended abstract) (Q826119) (← links)
- Approximating satisfiable satisfiability problems (Q1578395) (← links)
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- Conditional Hardness of Approximating Satisfiable Max 3CSP-q (Q3652279) (← links)
- Query-Efficient Dictatorship Testing with Perfect Completeness (Q4933378) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Hard satisfiable 3-SAT instances via autocorrelation (Q5015598) (← links)
- An Improved Dictatorship Test with Perfect Completeness (Q5136305) (← links)
- (Q6176154) (← links)