A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula (Q1199880)
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 96212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula |
scientific article; zbMATH DE number 96212 |
Statements
A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula (English)
0 references
17 January 1993
0 references
satisfiability
0 references
2-CNF
0 references
CRCW PRAM
0 references
EREW PRAM
0 references
0.7897163033485413
0 references
0.7871221899986267
0 references
0.7871221899986267
0 references
0.7747673988342285
0 references
