$On the geometry of $k$-SAT solutions: what more can PPZ and Sch\"oning's algorithms do?$

On the geometry of $k$-SAT solutions: what more can PPZ and Sch\"oning's algorithms do?

Given a $k$-CNF formula and an integer $s$, we study algorithms that obtain $s$ solutions to the formula that are maximally dispersed. For $s=2$, the problem of computing the diameter of a $k$-CNF formula was initiated by Creszenzi and Rossi, who showed strong hardness results even for $k=2$. Assumi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Austrin, Per, Bercea, Ioana O, Goswami, Mayank, Limaye, Nutan, Srinivasan, Adarsh
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!