CC
2008
Springer
13 years 4 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
RIVF
2008
13 years 6 months ago
2008
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()
STACS
2000
Springer
13 years 8 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...