3415 search results - page 80 / 683 » Lower Bounds for Kernelizations |
90
Voted
FSTTCS
2001
Springer
15 years 5 months ago
2001
Springer
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
WG
2001
Springer
15 years 5 months ago
2001
Springer
101
click to vote
COCO
2000
Springer
15 years 5 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
68
Voted
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
80
Voted
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE