On the complexity of deciding whether the regular number is at most two (Q497328): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6484812 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
regular number | |||
| Property / zbMATH Keywords: regular number / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
edge-partition problems | |||
| Property / zbMATH Keywords: edge-partition problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
not-all-equal 3-sat problem | |||
| Property / zbMATH Keywords: not-all-equal 3-sat problem / rank | |||
Normal rank | |||
Revision as of 23:23, 30 June 2023
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
