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). Formally, we prove lower bounds against the accuracy of FPC-interpretations that map Unique Games instances (encoded as relational structures) to rational...

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 20, Issue 2
Main Author:	Tucker-Foltz, Jamie
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 10.04.2024
Subjects:	computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!