𝔖 Bobbio Scriptorium

✦ LIBER ✦

[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 - Negation can be exponentially powerful

✍ Scribed by Valiant, L. G.

Book ID: 124101190
Publisher: ACM Press
Year: 1979
Weight: 519 KB
Category: Article
DOI: 10.1145/800135.804412

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[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

[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 - Area-time complexity for VLSI

✍ Thompson, C. D. 📂 Article 📅 1979 🏛 ACM Press ⚖ 520 KB

[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 - Finding patterns common to a set of strings (Extended Abstract)

✍ Angluin, Dana 📂 Article 📅 1979 🏛 ACM Press ⚖ 872 KB

[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 - Finding patterns common to a set of strings (Extended Abstract)

✍ Angluin, Dana 📂 Article 📅 1979 🏛 ACM Press ⚖ 872 KB

[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 - Deterministic CFL's are accepted simultaneously in polynomial time and log squared space

✍ Cook, Stephen A. 📂 Article 📅 1979 🏛 ACM Press ⚖ 610 KB

[ACM Press the fifth annual ACM symposiu

[ACM Press the fifth annual ACM symposium - Austin, Texas, United States (1973.04.30-1973.05.02)] Proceedings of the fifth annual ACM symposium on Theory of computing - STOC '73 - Fast computation of GCDs

✍ Moenck, R. T. 📂 Article 📅 1973 🏛 ACM Press ⚖ 576 KB