Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank

Combining graph theory and linear algebra, we study SAT problems of low “linear algebra complexity”, considering formulas with bounded hermitian rank. We show polynomial time SAT decision of the class of formulas with hermitian rank at most one, applying methods from hypergraph transversal theory. A...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Galesi, Nicola, Kullmann, Oliver
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Exact sciences and technology Logical, boolean and switching functions Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!