A CNF Formula Hierarchy over the Hypercube (Q5385533): 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: Polynomial-time inference of all valid implications for Horn and related formulae / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4503944 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A perspective on certain polynomial-time solvable classes of satisfiability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank | |||
Normal rank |
Latest revision as of 09:30, 28 June 2024
scientific article; zbMATH DE number 5271520
Language | Label | Description | Also known as |
---|---|---|---|
English | A CNF Formula Hierarchy over the Hypercube |
scientific article; zbMATH DE number 5271520 |
Statements
A CNF Formula Hierarchy over the Hypercube (English)
0 references
6 May 2008
0 references
satisfiability
0 references
hypercube formula
0 references
hypergraph
0 references
transversal
0 references
variable closure
0 references