Density condensation of Boolean formulas (Q860385): 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: A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A machine program for theorem-proving / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Computing Procedure for Quantification Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4699307 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of facets resolved / rank | |||
Normal rank |
Latest revision as of 12:04, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Density condensation of Boolean formulas |
scientific article |
Statements
Density condensation of Boolean formulas (English)
0 references
9 January 2007
0 references
Boolean formulas
0 references
density condensation
0 references
computational complexity
0 references
SAT algorithms
0 references