Fetching the paper…
Reading the bibliography…
This paper presents an efficient parallel approximation scheme for a new class of min-max problems.
Zur theorie der gesellschaftspiele
John von Neumann · 1928
Earlier work this paper cites.
Minimax theorems
K. Fan · 1953
Earlier work this paper cites.
On relating time and space to size and depth
Allan Borodin · 1977
Earlier work this paper cites.
Private coins versus public coins in interactive proof systems
Shafi Goldwasser and Michael Sipser · 1989
Earlier work this paper cites.
Approximating linear programming is log-space complete for P
Maria Serna · 1991
Earlier work this paper cites.
The complexity of two-person zero-sum games in extensive form
Daphne Koller and Nimrod Megiddo · 1992
Earlier work this paper cites.
Algebraic methods for interactive proof systems
Carsten Lund, Lance Fortnow, Howard Karloff, and Noam Nisan · 1992
Earlier work this paper cites.
A note on approximate linear programming
Nimrod Megiddo · 1992
Earlier work this paper cites.
IP = = PSPACE
Adi Shamir · 1992
Earlier work this paper cites.
A parallel approximation algorithm for positive linear programming
Michael Luby and Noam Nisan · 1993
Earlier work this paper cites.
Parallel linear algebra
Joachim von zur Gathen · 1993
Earlier work this paper cites.
Fast algorithms for finding randomized strategies in game trees
Daphne Koller, Nimrod Megiddo, and Bernhard von Stengel · 1994
Earlier work this paper cites.
Computational Complexity
Christos Papadimitriou · 1994
Earlier work this paper cites.
A game-theoretic classification of interactive complexity classes
Joan Feigenbaum, Daphne Koller, and Peter Shor · 1995
Cited alongside, same era.
Making games short
Uriel Feige and Joe Kilian · 1997
Cited alongside, same era.
The parallel complexity of positive linear programming
Luca Trevisan and Fatos Xhafa · 1998
Cited alongside, same era.
Cryptographic distinguishability measures for quantum mechanical states
Christopher Fuchs and Jeroen van de Graaf · 1999
Cited alongside, same era.
Parallelization, amplification, and exponential time simulation of quantum interactive proof system
Alexei Kitaev and John Watrous · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
Michael Nielsen and Issac Chuang · 2000
Cited alongside, same era.
Toward a general theory of quantum games
Gus Gutoski and John Watrous · 2007
Later among the works it cites.
Efficient algorithms using the multiplicative weights update method
Satyen Kale · 2007
Later among the works it cites.
On the complexity of succinct zero-sum games
Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, and Christopher Umans · 2008
Later among the works it cites.
Two-message quantum interactive proofs are in PSPACE
Rahul Jain, Sarvagya Upadhyay, and John Watrous · 2009
Later among the works it cites.
Parallel approximation of non-interactive zero-sum quantum games
Rahul Jain and John Watrous · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Neal Young · 2001
Cited alongside, same era.
Quantum coin-flipping
Alexei Kitaev · 2002
Cited alongside, same era.
The multiplicative weights update method: a meta algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2005
Cited alongside, same era.
Quantum interactive proofs with competing provers
Gus Gutoski and John Watrous · 2005
Cited alongside, same era.
Quantum Arthur-Merlin games
Chris Marriott and John Watrous · 2005
Cited alongside, same era.
On the hardness of distinguishing mixed-state quantum computations
Bill Rosgen and John Watrous · 2005
Cited alongside, same era.
Xiaodi Wu · 2010
Closest in time.
QIP = = PSPACE
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous · 2011
Closest in time.
A parallel approximation algorithm for positive semidefinite programming
Rahul Jain and Penghui Yao · 2011
Closest in time.
Lecture notes: Theory of quantum information
John Watrous · 2011
Closest in time.
Parallel approximation of min-max problems with applications to classical and quantum zero-sum games
Gus Gutoski and Xiaodi Wu · 2012
Closest in time.
A parallel approximation algorithm for mixed packing and covering semidefinite programs
Rahul Jain and Penghui Yao · 2012
Closest in time.
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
Richard Peng and Kanat Tangwongsan · 2012
Closest in time.