Undefinability of approximation of 2-to-2 games
From MaRDI portal
Cites work
- d-to-1 hardness of coloring 3-colorable graphs with o(1) colors
- Affine systems of equations and counting infinitary logic
- Algebraic Approach to Promise Constraint Satisfaction
- Conditional Hardness for Approximate Coloring
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Definable inapproximability: new challenges for duplicator
- Equi-rank homomorphism preservation theorem on finite structures
- scientific article; zbMATH DE number 5485536 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- Inapproximability of unique games in fixed-point logic with counting
- Interactive proofs and the hardness of approximating cliques
- On independent sets, 2-to-2 games, and Grassmann graphs
- On Monotonicity Testing and the 2-to-2 Games Conjecture
- On symmetric circuits and fixed-point logics
- On the hardness of approximating label-cover
- On the power of unique 2-prover 1-round games
- On weighted vs unweighted versions of combinatorial optimization problems
- Probabilistic checking of proofs
- Promise constraint satisfaction and width
- Proof verification and the hardness of approximation problems
- Pseudorandom sets in Grassmann graph have near-perfect expansion
- Pseudorandom sets in Grassmann graph have near-perfect expansion
- Pseudorandomness
- Some optimal inapproximability results
- Towards a proof of the 2-to-1 games conjecture?
This page was built for publication: Undefinability of approximation of 2-to-2 games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261422)
