On sparseness and Turing reducibility ov
โ
Felipe Cucker
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 517 KB
We prove some results about existence of NP-complete and NP-hard (for Turing reductions) sparse sets on different settings over the real numbers.