The complexity of the \(K\)th largest subset problem and related problems (Q894449)
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: The complexity of the Kth largest subset problem and related problems |
scientific article; zbMATH DE number 6515007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the \(K\)th largest subset problem and related problems |
scientific article; zbMATH DE number 6515007 |
Statements
The complexity of the \(K\)th largest subset problem and related problems (English)
0 references
1 December 2015
0 references
\(K\)th largest subset
0 references
\(K\)th largest \(m\)-tuple
0 references
counting problems
0 references
PP
0 references
computational complexity
0 references
0.7280877232551575
0 references
0.6960704922676086
0 references
