3415 search results - page 85 / 683 » Lower Bounds for Kernelizations |
WDAG
2000
Springer
15 years 7 months ago
2000
Springer
WG
2000
Springer
15 years 7 months ago
2000
Springer
111
Voted
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
120
Voted
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean