An improved generator for 3-CNF formulas (Q827897): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 07:37, 24 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
