1. Reductions to sets of low information content;Arvind,1993
2. On isomorphism and density of NP and other complete sets;Berman;SIAM J. Comput.,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;Bull. Amer. Math. Soc.,1989
5. Sparse sets versus complexity classes;Cai,1997