𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Houston, TX, USA (1976.10.25-1976.10.27)] 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Using computer trees to derive lower bounds for selection problems

✍ Scribed by Fussenegger, Frank; Gabow, Harold N.

Book ID: 126624172
Publisher: IEEE
Year: 1976
Weight: 531 KB
Category: Article
DOI: 10.1109/SFCS.1976.34

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 17th Annual Symposium on Foundatio

[IEEE 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Houston, TX, USA (1976.10.25-1976.10.27)] 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Geometric intersection problems

✍ Shamos, Michael Ian; Hoey, Dan 📂 Article 📅 1976 🏛 IEEE ⚖ 1011 KB

[IEEE 17th Annual Symposium on Foundatio

[IEEE 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Houston, TX, USA (1976.10.25-1976.10.27)] 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Categories for fixpoint-semantics

✍ Lehmann, Daniel J. 📂 Article 📅 1976 🏛 IEEE ⚖ 628 KB

[IEEE 17th Annual Symposium on Foundatio

[IEEE 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Houston, TX, USA (1976.10.25-1976.10.27)] 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Algebraic families of interpretations

✍ Courcelle, Bruno; Nivat, Maurice 📂 Article 📅 1976 🏛 IEEE ⚖ 812 KB

[IEEE 17th Annual Symposium on Foundatio

[IEEE 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Houston, TX, USA (1976.10.25-1976.10.27)] 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - On the structure of complete sets: Almost everywhere complexity and infinitely often speedup

✍ Berman, Leonard 📂 Article 📅 1976 🏛 IEEE ⚖ 559 KB

[IEEE 20th Annual Symposium on Foundatio

[IEEE 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) - San Juan, Puerto Rico (1979.10.29-1979.10.31)] 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) - A subexponential algorithm for the discrete logarithm problem with applications to cryptography

✍ Adleman, Leonard 📂 Article 📅 1979 🏛 IEEE ⚖ 340 KB

[IEEE 30th Annual Symposium on Foundatio

[IEEE 30th Annual Symposium on Foundations of Computer Science - Research Triangle Park, NC, USA (1989.10.30-1989.11.1)] 30th Annual Symposium on Foundations of Computer Science - Lower bounds for algebraic computation trees with integer inputs

✍ Yao, A.C.-C. 📂 Article 📅 1989 🏛 IEEE ⚖ 510 KB