1 search results - page 1 / 1 » dfg 1992 |
DFG
1992
Springer
13 years 10 months ago
1992
Springer
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...