On the complexity of deciding whether the regular number is at most two (Q497328)
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 complexity of deciding whether the regular number is at most two |
scientific article; zbMATH DE number 6484812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of deciding whether the regular number is at most two |
scientific article; zbMATH DE number 6484812 |
Statements
On the complexity of deciding whether the regular number is at most two (English)
0 references
24 September 2015
0 references
regular number
0 references
computational complexity
0 references
edge-partition problems
0 references
not-all-equal 3-sat problem
0 references
0.8143545985221863
0 references
0.793208122253418
0 references
0.7909324765205383
0 references
0.7854883670806885
0 references
0.7813389301300049
0 references
