508 search results - page 88 / 102 » Quantum Computers |
82
Voted
APSCC
2008
IEEE
15 years 4 months ago
2008
IEEE
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
IFIPTCS
2010
14 years 7 months ago
2010
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new cl...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
188
click to vote
Book
"This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of ...