@inbook{9393d2af37e74899af5f8ce7cc12b8e3,
title = "Computability over an arbitrary structure. Sequential and parallel polynomial time",
abstract = "We provide several machine-independent characterizations of deterministic complexity classes in the model of computation proposed by L. Blum, M. Shub and S. Smale. We provide a characterization of partial recursive functions over any arbitrary structure. We show that polynomial time computable functions over any arbitrary structure can be characterized in term of safe recursive functions. We show that polynomial parallel time decision problems over any arbitrary structure can be characterized in terms of safe recursive functions with substitutions.",
author = "Olivier Bournez and Felipe Cucker and \{De Naurois\}, \{Paulin Jacob{\'e}\} and Marion, \{Jean Yves\}",
year = "2003",
month = jan,
day = "1",
doi = "10.1007/3-540-36576-1\_12",
language = "English",
isbn = "3540008977",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "185--199",
editor = "Gordon, \{Andrew D.\}",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}