A fast deterministic algorithm for formulas that have many satisfying assignments (Q4380447): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:27, 7 February 2024
scientific article; zbMATH DE number 1129207
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast deterministic algorithm for formulas that have many satisfying assignments |
scientific article; zbMATH DE number 1129207 |
Statements
A fast deterministic algorithm for formulas that have many satisfying assignments (English)
0 references
17 March 1998
0 references
satisfying assignment for a Boolean formula
0 references
deterministic algorithm
0 references
