Theory of Computing
Collection
Collection
Published by Association for Computing Machinery
-
Quantum Fanout is Powerful Article
Theory of Computing, 1(5), 83-101.January 2005
-
All Quantum Adversary Methods are Equivalent Article
Theory of Computing, 1-18.January 2006
-
Quantum proofs for classical theorems Article
Theory of ComputingJanuary 2010
-
Quantum proofs for classical theorems Article
Theory of ComputingJanuary 2011
-
Near-optimal and explicit Bell inequality violations Article
Theory of Computing, 8(27), 623-645.H.M. Buhrman (Harry), O. Regev (Oded), G. Scarpa (Giannicola) and R.M. de Wolf (Ronald)
January 2012
-
Grothendieck Inequalities for Semidefinite Programs with Rank Constraint Article
Theory of Computing, 77-105.J. Briët (Jop), F. Vallentin (Frank) and F.M. de Oliveira Filho (Fernando Mario)
May 2014
-
Lattice sparsification and the Approximate Closest Vector Problem Article
Theory of ComputingJune 2016
-
A survey of quantum property testing Article
Theory of Computing, ToC Library(Graduate Surveys)July 2016