Sciweavers

6274 search results - page 47 / 1255
» From query complexity to computational complexity
Sort
View
123
Voted
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
15 years 8 months ago
The round complexity of two-party random selection
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...
Saurabh Sanghvi, Salil P. Vadhan
106
Voted
LICS
1999
IEEE
15 years 7 months ago
Some Decision Problems of Enormous Complexity
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...
Harvey Friedman
101
Voted
SOFSEM
2010
Springer
15 years 11 months ago
Flavors of KWQL, a Keyword Query Language for a Semantic Wiki
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...
François Bry, Klara A. Weiand
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 7 months ago
Quantum versus Classical Learnability
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...
Rocco A. Servedio, Steven J. Gortler
89
Voted
CCA
2009
Springer
15 years 9 months ago
Towards the Complexity of Riemann Mappings (Extended Abstract)
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...
Robert Rettinger