An improved generator for 3-CNF formulas (Q827897): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5503674 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4375756 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4542576 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The probabilistic analysis of a greedy satisfiability algorithm / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1134/s0005117920010117 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3008398386 / rank | |||
Normal rank |
Latest revision as of 09:37, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved generator for 3-CNF formulas |
scientific article |
Statements
An improved generator for 3-CNF formulas (English)
0 references
14 January 2021
0 references
satisfiability problem (SAT)
0 references
conjunctive normal form (CNF)
0 references
clause
0 references
Boolean variables
0 references