Sciweavers

COCO
2006
Springer
113views Algorithms» more  COCO 2006»
13 years 8 months ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...