3415 search results - page 85 / 683 » Lower Bounds for Kernelizations |
76
Voted
WDAG
2000
Springer
15 years 4 months ago
2000
Springer
72
Voted
WG
2000
Springer
15 years 4 months ago
2000
Springer
83
Voted
FOCS
1995
IEEE
15 years 4 months ago
1995
IEEE
86
Voted
STOC
1995
ACM
15 years 4 months ago
1995
ACM
FOCS
1991
IEEE
15 years 4 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