On Some Aspects of Mixed Horn Formulas (Q3637161): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: STACS 2004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3429016 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nested satisfiability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Satisfiability of mixed Horn formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear CNF formulas and satisfiability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2741531 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of satisfiability problems / rank | |||
Normal rank |
Latest revision as of 18:58, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Some Aspects of Mixed Horn Formulas |
scientific article |
Statements
On Some Aspects of Mixed Horn Formulas (English)
0 references
7 July 2009
0 references
mixed Horn formula
0 references
satisfiability
0 references
polynomial time reduction
0 references
exact algorithm
0 references
NP-completeness
0 references