Sciweavers

29908 search results - page 611 / 5982
» On the Complexity of
Sort
View
186
Voted
CIAC
2006
Springer
110views Algorithms» more  CIAC 2006»
15 years 11 months ago
Distance Approximating Trees: Complexity and Algorithms
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
Feodor F. Dragan, Chenyu Yan
CIE
2006
Springer
15 years 11 months ago
Logspace Complexity of Functions and Structures
Douglas Cenzer, Zia Uddin
CIE
2006
Springer
15 years 11 months ago
Prefix-Like Complexities and Computability in the Limit
Alexey V. Chernov, Jürgen Schmidhuber