2168 search results - page 73 / 434 » Randomized Algorithms and Complexity Theory |
138
click to vote
COCO
2001
Springer
15 years 7 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
153
click to vote
COCO
2009
Springer
15 years 9 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
127
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
125
click to vote
IJAC
2008
15 years 3 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
118
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...