Descriptive complexity of list H-coloring problems in logspace: a refined dichotomy (Q4635829)
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 6863413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptive complexity of list H-coloring problems in logspace: a refined dichotomy |
scientific article; zbMATH DE number 6863413 |
Statements
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (English)
0 references
23 April 2018
0 references
0.910250723361969
0 references
0.8388206362724304
0 references
0.7999851703643799
0 references
0.7994875311851501
0 references
0.7853121757507324
0 references
