10988 search results - page 92 / 2198 » Algorithmic Folding Complexity |
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
120
Voted
JC
2007
15 years 2 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
114
Voted
UAI
2004
15 years 3 months ago
2004
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
101
Voted
ICALP
2005
Springer
15 years 7 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...
COCO
2009
Springer
15 years 9 months ago
2009
Springer
