The complexity of the \(K\)th largest subset problem and related problems (Q894449): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1501.06729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Selection in <i>X</i> + <i>Y</i> and Other Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting the <i>K</i>th Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Planar Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of power-index comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Vertex Enumeration Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computational Structures / rank
 
Normal rank

Latest revision as of 04:07, 11 July 2024

scientific article
Language Label Description Also known as
English
The complexity of the \(K\)th largest subset problem and related problems
scientific article

    Statements

    The complexity of the \(K\)th largest subset problem and related problems (English)
    0 references
    0 references
    0 references
    1 December 2015
    0 references
    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 references
    0 references