[ACM Press the ninth annual ACM symposium - Boulder, Colorado, United States (1977.05.04-1977.05.04)] Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 - Computability and completeness in logics of programs (Preliminary Report)

[ACM Press the ninth annual ACM symposiu

[ACM Press the ninth annual ACM symposium - Boulder, Colorado, United States (1977.05.04-1977.05.04)] Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 - Reducibility, randomness, and intractibility (Abstract)

✍ Adleman, Leonard; Manders, Kenneth 📂 Article 📅 1977 🏛 ACM Press ⚖ 487 KB

[ACM Press the ninth annual ACM symposiu

[ACM Press the ninth annual ACM symposium - Boulder, Colorado, United States (1977.05.04-1977.05.04)] Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 - A new representation for linear lists

✍ Guibas, Leo J.; McCreight, Edward M.; Plass, Michael F.; Roberts, Janet R. 📂 Article 📅 1977 🏛 ACM Press ⚖ 812 KB

[ACM Press the twenty-ninth annual ACM s

[ACM Press the twenty-ninth annual ACM symposium - El Paso, Texas, United States (1997.05.04-1997.05.06)] Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 - Approximation of k -set cover by semi-local optimization

✍ Duh, Rong-chii; Fürer, Martin 📂 Article 📅 1997 🏛 ACM Press 🌐 English ⚖ 860 KB

[ACM Press the second annual ACM symposi

[ACM Press the second annual ACM symposium - Northampton, Massachusetts, United States (1970.05.04-1970.05.06)] Proceedings of the second annual ACM symposium on Theory of computing - STOC '70 - Unsolvability considerations in computational complexity

✍ Lewis, F. D. 📂 Article 📅 1970 🏛 ACM Press ⚖ 655 KB

[ACM Press the second annual ACM symposi

[ACM Press the second annual ACM symposium - Northampton, Massachusetts, United States (1970.05.04-1970.05.06)] Proceedings of the second annual ACM symposium on Theory of computing - STOC '70 - Unsolvability considerations in computational complexity

✍ Lewis, F. D. 📂 Article 📅 1970 🏛 ACM Press ⚖ 655 KB

The study of Computational Complexity began with the investigatio~ of Turing machine computations with limits on the amounts of tape or time which could be used. Latter a set of general axioms for measures of resource limiting was presented and this instigated much study of the properties of these

[ACM Press the eleventh annual ACM sympo

[ACM Press the eleventh annual ACM symposium - Atlanta, Georgia, United States (1979.04.30-1979.05.02)] Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79 - Completeness classes in algebra

✍ Valiant, L. G. 📂 Article 📅 1979 🏛 ACM Press ⚖ 889 KB