On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems |
scientific article; zbMATH DE number 3850482
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems |
scientific article; zbMATH DE number 3850482 |
Statements
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (English)
0 references
1984
0 references
algorithmic complexity
0 references
hypergraph coloring
0 references
Steiner systems
0 references
0 references
0 references
0.9227383
0 references
0.9132222
0 references
0.9114257
0 references
0.9049356
0 references
0.9025511
0 references
0.9004287
0 references
