𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Tucson, AZ, USA (1983.11.7-1983.11.9)] 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Generalized Kolmogorov complexity and the structure of feasible computations

✍ Scribed by Hartmanis, Juris

Book ID: 121705198
Publisher: IEEE
Year: 1983
Weight: 906 KB
Category: Article
ISBN-13: 9780818605086
DOI: 10.1109/sfcs.1983.21

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 24th Annual Symposium on Foundatio

[IEEE 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Tucson, AZ, USA (1983.11.7-1983.11.9)] 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Randomized byzantine generals

✍ Rabin, Michael O. 📂 Article 📅 1983 🏛 IEEE ⚖ 942 KB

[IEEE 24th Annual Symposium on Foundatio

[IEEE 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Tucson, AZ, USA (1983.11.7-1983.11.9)] 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Representations of rational functions

✍ von zur Gathen, Joachim 📂 Article 📅 1983 🏛 IEEE ⚖ 691 KB

[IEEE 24th Annual Symposium on Foundatio

[IEEE 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Tucson, AZ, USA (1983.11.7-1983.11.9)] 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Improved upper bounds on shellsort

✍ Incerpi, Janet; Sedgewick, Robert 📂 Article 📅 1983 🏛 IEEE ⚖ 836 KB

[IEEE 18th Annual Symposium on Foundatio

[IEEE 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) - Providence, RI, USA (1977.10.31-1977.11.2)] 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) - Probabilistic computations: Toward a unified measure of complexity

✍ Yao, Andrew Chi-Chin 📂 Article 📅 1977 🏛 IEEE ⚖ 611 KB

[IEEE 23rd Annual Symposium on Foundatio

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Three applications of Kolmogorov-complexity

✍ Reisch, Stefan; Reisch, Stefan; Reisch, Stefan; Reisch, Stefan; Schnitger, Georg 📂 Article 📅 1982 🏛 IEEE ⚖ 577 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