Sciweavers

3415 search results - page 83 / 683
» Lower Bounds for Kernelizations
Sort
View
WADS
1997
Springer
93views Algorithms» more  WADS 1997»
15 years 8 months ago
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds
Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
DFG
1992
Springer
15 years 8 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski
WADS
1993
Springer
87views Algorithms» more  WADS 1993»
15 years 8 months ago
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
Lars Arge, Mikael Knudsen, Kirsten Larsen