934 search results - page 37 / 187 » Quantum Algorithmic Entropy |
ICALP
2005
Springer
14 years 2 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...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
ACL
1998
13 years 10 months ago
1998
Maximum entropy framework proved to be expressive and powerful for the statistical language modelling, but it suffers from the computational expensiveness of the model building. T...
STOC
2006
ACM
14 years 2 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
IWANN
2001
Springer
14 years 1 months ago
2001
Springer
Marques and Almeida [9] recently proposed a nonlinear data seperation technique based on the maximum entropy principle of Bell and Sejnowsky. The idea behind is a pattern repulsion...