Inapproximability of unique games in fixed-point logic with counting
From MaRDI portal
Publication:6563050
DOI10.46298/LMCS-20(2:3)2024MaRDI QIDQ6563050
Publication date: 27 June 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectral algorithms for unique games
- Elements of finite model theory.
- Affine systems of equations and counting infinitary logic
- A restricted second order logic for finite structures
- Logical hierarchies in PTIME
- On symmetric circuits and fixed-point logics
- Solving Linear Programs without Breaking Abstractions
- Approximate Lasserre Integrality Gap for Unique Games
- Relational queries computable in polynomial time
- A new series of dense graphs of high girth
- Computational topology and the Unique Games Conjecture
- Definable inapproximability: new challenges for duplicator
- On non-optimally expanding sets in Grassmann graphs
- A new point of NP-hardness for unique games
- Rudiments of \(\mu\)-calculus
This page was built for publication: Inapproximability of unique games in fixed-point logic with counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563050)
