✦ LIBER ✦

On sparseness, reducibilities, and complexity

✍ Scribed by Felipe Cucker

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Post's Problem for Reducibilities of Bou

✍ Valeriy K. Bulitko 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

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.

On the Complexity of Sparse Elimination

✍ Ioannis Z. Emiris 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Complexity Classes and Sparse Oracles

✍ D.P. Bovet; P. Crescenzi; R. Silvestri 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 710 KB

Strong and robustly strong polynomial-ti

✍ Ricard Gavaldà; JoséL. Balcázar 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 944 KB

On the (semi)lattices induced by continu

✍ Arno Pauly 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB