The Curse and Blessing of Not-All-Equal in k-Satisfiability

As a natural variant of the $k$-SAT problem, NAE-$k$-SAT additionally requires the literals in each clause to take not-all-equal (NAE) truth values. In this paper, we study the worst-case time complexities of solving NAE-$k$-SAT and MAX-NAE-$k$-SAT approximation, as functions of $k$, the number of v...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Liu, S. Cliff
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!