Sciweavers

IFIP
2004
Springer
13 years 10 months ago
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...