A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula (Q1199880): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4773298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved parallel algorithm that computes the BFS numbering of a directed graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank | |||
Normal rank | |||
Latest revision as of 12:09, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula |
scientific article |
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
