6274 search results - page 47 / 1255 » From query complexity to computational complexity |
STOC
2005
ACM
14 years 3 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
LICS
1999
IEEE
14 years 2 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. This article introduces KWQL, spoken “quickel”, a rulebased query language for a semantic wiki based on the label-keyword query paradigm. KWQL allows for rich combine...
COCO
2001
Springer
14 years 2 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...
CCA
2009
Springer
14 years 4 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...