𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE Comput. Soc. Press [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference - Eugene, OR, USA (19-22 June 1989)] [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference - The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory

✍ Scribed by Shore, R.A.; Slaman, T.A.

Book ID: 126612728
Publisher: IEEE Comput. Soc. Press
Year: 1989
Weight: 936 KB
Category: Article
ISBN-13: 9780818619588
DOI: 10.1109/SCT.1989.41804

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE Comput. Soc. Press [1989] Proceedi

[IEEE Comput. Soc. Press [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference - Eugene, OR, USA (19-22 June 1989)] [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference - The complexity of iterated multiplication

✍ Immerman, N.; Landau, S. 📂 Article 📅 1989 🏛 IEEE Comput. Soc. Press ⚖ 662 KB

[IEEE Comput. Soc. Press [1989] Proceedi

[IEEE Comput. Soc. Press [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference - Eugene, OR, USA (19-22 June 1989)] [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference - Turning machines with few accepting computations and low sets for PP

✍ Kobler, J.; Schoning, U.; Toda, S.; Toran, J. 📂 Article 📅 1989 🏛 IEEE Comput. Soc. Press ⚖ 608 KB

[IEEE Comput. Soc. Press [1992] Seventh

[IEEE Comput. Soc. Press [1992] Seventh Annual Structure in Complexity Theory Conference - Boston, MA, USA (22-25 June 1992)] [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference - On average P vs. average NP

✍ Wang, J.; Belanger, J. 📂 Article 📅 1992 🏛 IEEE Comput. Soc. Press ⚖ 804 KB

[IEEE Comput. Soc. Press [1992] Seventh

[IEEE Comput. Soc. Press [1992] Seventh Annual Structure in Complexity Theory Conference - Boston, MA, USA (22-25 June 1992)] [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference - On closeness of NP-hard sets to other complexity classes

✍ Fin Fu, ; Hong-zhou Li, 📂 Article 📅 1992 🏛 IEEE Comput. Soc. Press ⚖ 435 KB