Number of models and satisfiability of sets of clauses (Q672138): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5679729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The relative efficiency of propositional proof systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / 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: Q4283247 / rank | |||
Normal rank |
Revision as of 10:15, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Number of models and satisfiability of sets of clauses |
scientific article |
Statements
Number of models and satisfiability of sets of clauses (English)
0 references
27 February 1997
0 references
satisfiability
0 references
propositional formulas represented by sets of clauses
0 references
3-SAT problems
0 references