On the public citation graph
Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games
0 signed · 43 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_50openalex-snapshot
Quantum Interactive Proofs with Competing Provers
inferredcites →https://doi.org/10.1007/bf01448847openalex-snapshot
Zur Theorie der Gesellschaftsspiele
inferredcites →https://doi.org/10.1007/s00037-005-0194-xopenalex-snapshot
Quantum Arthur–Merlin games
inferredcites →https://doi.org/10.1007/s00037-008-0252-2openalex-snapshot
On the Complexity of Succinct Zero-Sum Games
inferredcites →https://doi.org/10.1007/s10994-011-5269-0openalex-snapshot
Online variance minimization
inferredcites →https://doi.org/10.1016/0020-0190(91)90194-mopenalex-snapshot
Approximating linear programming is log-space complete for P
inferredcites →https://doi.org/10.1016/0020-0190(92)90132-fopenalex-snapshot
A note on approximate linear programming
inferredcites →https://doi.org/10.1016/0167-739x(89)90006-xopenalex-snapshot
Solving the least squares problem using a parallel linear algebra library
inferredcites →https://doi.org/10.1016/0899-8256(92)90035-qopenalex-snapshot
The complexity of two-person zero-sum games in extensive form
inferredcites →https://doi.org/10.1109/18.761271openalex-snapshot
Cryptographic distinguishability measures for quantum-mechanical states
inferredcites →https://doi.org/10.1109/ccc.2005.37openalex-snapshot
Upper bounds for quantum interactive proofs with competing provers
inferredcites →https://doi.org/10.1109/ccc.2009.26openalex-snapshot
Parallel Approximation of Non-interactive Zero-sum Quantum Games
inferredcites →https://doi.org/10.1109/focs.2009.30openalex-snapshot
Two-Message Quantum Interactive Proofs Are in PSPACE
inferredcites →https://doi.org/10.1109/focs.2011.25openalex-snapshot
A Parallel Approximation Algorithm for Positive Semidefinite Programming
inferredcites →https://doi.org/10.1109/sct.1995.514861openalex-snapshot
A game-theoretic classification of interactive complexity classes
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1142/s0129626498000511openalex-snapshot
The Parallel Complexity of Positive Linear Programming
inferredcites →https://doi.org/10.1145/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/1250790.1250823openalex-snapshot
A combinatorial, primal-dual approach to semidefinite programs
inferredcites →https://doi.org/10.1145/1250790.1250873openalex-snapshot
Toward a general theory of quantum games
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/167088.167211openalex-snapshot
A parallel approximation algorithm for positive linear programming
inferredcites →https://doi.org/10.1145/195058.195451openalex-snapshot
Fast algorithms for finding randomized strategies in game trees
inferredcites →https://doi.org/10.1145/258533.258644openalex-snapshot
Making games short (extended abstract)
inferredcites →https://doi.org/10.1145/335305.335387openalex-snapshot
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.48550/arxiv.1004.0264openalex-snapshot
Equilibrium Value Method for the Proof of QIP=PSPACE
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_67openalex-snapshot
Epsilon-Net Method for Optimizations over Separable States
inferred← citeshttps://doi.org/10.1007/s00037-013-0065-9openalex-snapshot
Parallel Approximation of Min-Max Problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.031openalex-snapshot
Epsilon-net method for optimizations over separable states
inferred← citeshttps://doi.org/10.1109/chicc.2014.6895953openalex-snapshot
Does quantization always make games fairer?
inferred← citeshttps://doi.org/10.1145/2090236.2090241openalex-snapshot
Quantum strategic game theory
inferred← citeshttps://doi.org/10.1145/2090236.2090259openalex-snapshot
Quantum interactive proofs with weak error bounds
inferred← citeshttps://doi.org/10.1145/3009837.3009840openalex-snapshot
Invariants of quantum programs: characterisations and generation
inferred← citeshttps://doi.org/10.4230/lipics.esa.2018.66openalex-snapshot
A Compressed Classical Description of Quantum States
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2020.23openalex-snapshot
Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.