A Complexity Index for Satisfiability Problems (Q4286227)
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 540345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Complexity Index for Satisfiability Problems |
scientific article; zbMATH DE number 540345 |
Statements
A Complexity Index for Satisfiability Problems (English)
0 references
16 August 1994
0 references
polynomial algorithms
0 references
NP completeness
0 references
Boolean satisfiability
0 references
conjunctive normal form
0 references
satisfiability problems
0 references
0.93602884
0 references
0.8982766
0 references
0 references
0.8966433
0 references
0.89610136
0 references
0.89474285
0 references
0.89474285
0 references
0.89152294
0 references
