179 search results - page 18 / 36 » eccc 2010 |
ECCC
2000
13 years 7 months ago
2000
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
ECCC
2000
13 years 7 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
ECCC
2002
13 years 7 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
ECCC
2002
13 years 7 months ago
2002
We say that a distribution over {0, 1}n is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. ...
ECCC
2006
13 years 7 months ago
2006
We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...