On the complexity of deciding whether the regular number is at most two (Q497328): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-014-1446-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-014-1446-9 / rank | |||
Normal rank | |||
Revision as of 02:49, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of deciding whether the regular number is at most two |
scientific article |
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
