The maximum length of prime implicates for instances of 3-SAT (Q1402744): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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 threshold for unsatisfiability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implicates and prime implicates in random 3-SAT / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0004-3702(97)00018-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2092428555 / rank | |||
Normal rank |
Latest revision as of 09:23, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The maximum length of prime implicates for instances of 3-SAT |
scientific article |
Statements
The maximum length of prime implicates for instances of 3-SAT (English)
0 references
28 August 2003
0 references
3-CNF formulae
0 references
Prime implicates
0 references
Satisfiability
0 references