1677 search results - page 17 / 336 » On the Completeness of Quantum Computation Models |
128
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
FUIN
2008
15 years 1 months ago
2008
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
113
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
136
click to vote
AC
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...