On the complexity of the partner units decision problem (Q2407462)
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 6783361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the partner units decision problem |
scientific article; zbMATH DE number 6783361 |
Statements
On the complexity of the partner units decision problem (English)
0 references
29 September 2017
0 references
partner units problem
0 references
computational complexity
0 references
NP-completeness
0 references
0.9028963446617126
0 references
0.8039599657058716
0 references
0.6923646926879883
0 references
0.6909314393997192
0 references
