On the computational complexity of defining sets (Q2387433)
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 2201775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of defining sets |
scientific article; zbMATH DE number 2201775 |
Statements
On the computational complexity of defining sets (English)
0 references
2 September 2005
0 references
Defining sets
0 references
Complexity
0 references
Graph coloring
0 references
Satisfiability
0 references
0.772043764591217
0 references
0.7720434069633484
0 references
0.7680988907814026
0 references
0.7634973526000977
0 references
