Inapproximability of Unique Games in Fixed-Point Logic with Counting

We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC). We prove two new FPC- inexpressibility results for Unique Games: the existence of a \left( {\frac{1}{2},\frac{1}{3} + \delta } \right)-inapproximability g...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Author:	Tucker-Foltz, Jamie
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Approximation algorithms Complexity theory Computer science Games Graph theory Linear algebra
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!