16 search results - page 3 / 4 » coco 2001 |
COCO
2001
Springer
13 years 9 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
COCO
2006
Springer
13 years 6 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
COCO
2001
Springer
13 years 9 months ago
2001
Springer
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
COCO
2001
Springer
13 years 9 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...
COCO
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...