[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

[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

[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 - NP-complete decision problems for quadratic polynomials

✍ Manders, Kenneth; Adleman, Leonard 📂 Article 📅 1976 🏛 ACM Press ⚖ 431 KB

[ACM Press the twelfth annual symposium

[ACM Press the twelfth annual symposium - Philadelphia, Pennsylvania, United States (1996.05.24-1996.05.26)] Proceedings of the twelfth annual symposium on Computational geometry - SCG '96 - A package for triangulations

✍ Ono, T.; Avis, D.; Kyoda, Y.; Masada, T.; Hayase, K.; Shibuya, T.; Nakade, M.; I 📂 Article 📅 1996 🏛 ACM Press ⚖ 198 KB

[ACM Press the twenty-fifth annual ACM s

[ACM Press the twenty-fifth annual ACM symposium - San Diego, California, United States (1993.05.16-1993.05.18)] Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 - More deterministic simulation in logspace

✍ Nisan, Noam; Zuckerman, David 📂 Article 📅 1993 🏛 ACM Press ⚖ 807 KB

[ACM Press the twenty-fifth annual ACM s

[ACM Press the twenty-fifth annual ACM symposium - San Diego, California, United States (1993.05.16-1993.05.18)] Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 - More deterministic simulation in logspace

✍ Nisan, Noam; Zuckerman, David 📂 Article 📅 1993 🏛 ACM Press ⚖ 807 KB

We show that any randomized space(S) algorithm which uses only poly(S) random bits can be simulated deterministically in space(S), for S(n) ~log n. Of independent interest is our main technical tool: a procedure which extracts randomness from a defective random source using a small additional number