A fast deterministic algorithm for formulas that have many satisfying assignments (Q4380447): Difference between revisions
From MaRDI portal
Created a new 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 / OpenAlex ID | |||
| Property / OpenAlex ID: W1999002596 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:45, 19 March 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
