Subject
General Computer Science,Theoretical Computer Science
Reference6 articles.
1. Complexity and Real Computation;Blum,1998
2. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines;Blum;Bull. Amer. Math. Soc.,1989
3. J. Cai, M. Ogihara, Sparse sets versus complexity classes, in: L. Hemspaandra, A. Selman (Eds.), Complexity Theory Retrospective II, Springer, Berlin, 1997.
4. Complexity and dimension;Cucker;Inform. Process. Lett.,1997
5. H. Fournier, P. Koiran, Lower bounds are not easier over the reals: Inside PH, LIP Research Report 99-21, Ecole Normale Supérieure de Lyon, 1999.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On sparseness, reducibilities, and complexity;Annals of Pure and Applied Logic;2005-06
2. On sparseness and Turing reducibility over the reals;Electronic Notes in Theoretical Computer Science;2002-10
3. There are No Sparse NPw-Hard Sets;SIAM Journal on Computing;2001-01
4. There Are No Sparse NPw-Hard Sets;Mathematical Foundations of Computer Science 2001;2001