21 search results - page 3 / 5 » coco 2003 |
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
COCOS
2003
Springer
13 years 10 months ago
2003
Springer
This paper details a technique, called inter-block backtracking (IBB), which improves interval solving of decomposed systems with non-linear equations over the reals. This techniqu...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...