Parallel approximation of min-max problems (Q354658): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083633130 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.2787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relating Time and Space to Size and Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of succinct zero-sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic distinguishability measures for quantum-mechanical states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Algebraic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel approximation of min-max problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: QIP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Message Quantum Interactive Proofs Are in PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Approximation Algorithm for Positive Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-person zero-sum games in extensive form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for finding randomized strategies in game trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel approximation algorithm for positive linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Arthur-Merlin games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximate linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating linear programming is log-space complete for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: IP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Variance Minimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:16, 6 July 2024

scientific article
Language Label Description Also known as
English
Parallel approximation of min-max problems
scientific article

    Statements

    Parallel approximation of min-max problems (English)
    0 references
    0 references
    0 references
    19 July 2013
    0 references
    parallel approximation algorithm
    0 references
    semidefinite programming
    0 references
    zero-sum games
    0 references
    quantum interactive proofs with competing provers
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references