A fast deterministic algorithm for formulas that have many satisfying assignments (Q4380447)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1129207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8323356509208679
0 references
0.830244779586792
0 references
0.8284571170806885
0 references
0.7886734008789062
0 references
0.7818775177001953
0 references
How can we find any satisfying assignment for a Boolean formula that has many satisfying assignments? This paper presents a polynomial-time deterministic algorithm that solves this problem and shows that its worst-case running time is linear when input formulas are in \(\kappa\)-CNF and a fraction of satisfying assignments is greater than a constant. Another result: if a formula in \(\kappa\)-CNF has many satisfying assignments, then there exists a short satisfying assignment.
0 references
