Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Reductions to sets of low information content;Arvind,1993
2. On isomorphism and density of NP and other complete sets;Berman;SIAM Journal on Computing,1977
3. Complexity and Real Computation;Blum,1998
4. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines;Blum;Bulletin of the Amer. Math. Soc,1989
5. M. Coste. An Introduction to o-minimal Geometry. Istituti Editoriali e Poligrafici Internazionali, 2000.