[ACM Press the twentieth annual ACM symposium - Chicago, Illinois, United States (1988.05.02-1988.05.04)] Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 - Small sets supporting fary embeddings of planar graphs

[ACM Press the twentieth annual ACM symp

[ACM Press the twentieth annual ACM symposium - Chicago, Illinois, United States (1988.05.02-1988.05.04)] Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 - On the communication complexity of graph properties

✍ Hajnal, András; Maass, Wolfgang; Turán, György 📂 Article 📅 1988 🏛 ACM Press ⚖ 584 KB

[ACM Press the twentieth annual ACM symp

[ACM Press the twentieth annual ACM symposium - Chicago, Illinois, United States (1988.05.02-1988.05.04)] Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 - Expressing combinatorial optimization problems by linear programs

✍ Yannakakis, Mihalis 📂 Article 📅 1988 🏛 ACM Press ⚖ 609 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

[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 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