A Short Note on Linear Autarkies, q-Horn Formulas and the Complexity Index

Authors:
Maaren Hans van
Affiliations:
-
Venue:
A Short Note on Linear Autarkies, q-Horn Formulas and the Complexity Index
Year:
1999

Citing 0
Cited 2

Typical case complexity of satisfiability algorithms and the threshold phenomenon

Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the tractable class of CNF formulas solvable by Linear Autarkies properly contains the class of q-Horn formulas and that it is incomparable with SLUR.