Sciweavers

235 search results - page 24 / 47
» Quantum certificate complexity
Sort
View
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
14 years 2 days ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 7 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
FROCOS
2007
Springer
13 years 11 months ago
Certification of Automated Termination Proofs
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
Evelyne Contejean, Pierre Courtieu, Julien Forest,...
ISAAC
2007
Springer
105views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Unbounded-Error Classical and Quantum Communication Complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...