𝔖 Bobbio Scriptorium

✦ LIBER ✦

[ACM Press the eighth annual ACM symposium - Hershey, Pennsylvania, United States (1976.05.03-1976.05.05)] Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 - NP-complete decision problems for quadratic polynomials

✍ Scribed by Manders, Kenneth; Adleman, Leonard

Book ID: 121312155
Publisher: ACM Press
Year: 1976
Weight: 431 KB
Category: Article
DOI: 10.1145/800113.803627

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[ACM Press the eighth annual ACM symposi

[ACM Press the eighth annual ACM symposium - Hershey, Pennsylvania, United States (1976.05.03-1976.05.05)] Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 - Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)

✍ Cardoza, E.; Lipton, R.; Meyer, A. R. 📂 Article 📅 1976 🏛 ACM Press ⚖ 412 KB

[ACM Press the eighth annual ACM symposi

[ACM Press the eighth annual ACM symposium - Hershey, Pennsylvania, United States (1976.05.03-1976.05.05)] Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 - Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)

✍ Cardoza, E.; Lipton, R.; Meyer, A. R. 📂 Article 📅 1976 🏛 ACM Press ⚖ 412 KB

[ACM Press the eighth annual ACM symposi

[ACM Press the eighth annual ACM symposium - Hershey, Pennsylvania, United States (1976.05.03-1976.05.05)] Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 - On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store

✍ Sudborough, I. H. 📂 Article 📅 1976 🏛 ACM Press ⚖ 585 KB

[ACM Press the twenty-eighth annual ACM

[ACM Press the twenty-eighth annual ACM symposium - Philadelphia, Pennsylvania, United States (1996.05.22-1996.05.24)] Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 - Generating random spanning trees more quickly than the cover time

✍ Wilson, David Bruce 📂 Article 📅 1996 🏛 ACM Press 🌐 English ⚖ 699 KB

[ACM Press the twenty-eighth annual ACM

[ACM Press the twenty-eighth annual ACM symposium - Philadelphia, Pennsylvania, United States (1996.05.22-1996.05.24)] Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 - Approximating s-t minimum cuts in Õ ( n 2 ) time

✍ Benczúr, András A.; Karger, David R. 📂 Article 📅 1996 🏛 ACM Press 🌐 English ⚖ 928 KB

[ACM Press the twenty-eighth annual ACM

[ACM Press the twenty-eighth annual ACM symposium - Philadelphia, Pennsylvania, United States (1996.05.22-1996.05.24)] Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 - Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING

✍ Klein, Philip; Lu, Hsueh-I 📂 Article 📅 1996 🏛 ACM Press 🌐 English ⚖ 862 KB