Sciweavers

Share
CC
2008
Springer
133views System Software» more  CC 2008»
8 years 3 months ago
Hardness Amplification via Space-Efficient Direct Products
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...
Venkatesan Guruswami, Valentine Kabanets
RIVF
2008
8 years 4 months ago
On the bounded integer programming
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()
Thân Quang Khoát
STACS
2000
Springer
8 years 7 months ago
Almost Complete Sets
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 ...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, S...
books