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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Logical methods in computer science Jg. 20, Issue 2
1. Verfasser:	Tucker-Foltz, Jamie
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science e.V 10.04.2024
Schlagworte:	computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!