Sciweavers

213 search results - page 16 / 43
» Semidefinite programming
Sort
View
DAGSTUHL
2006
13 years 10 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 8 months ago
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 8 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu