[ACM Press the eighteenth annual ACM symposium - Berkeley, California, United States (1986.05.28-1986.05.30)] Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 - Private coins versus public coins in interactive proof systems

[ACM Press the eighteenth annual ACM sym

[ACM Press the eighteenth annual ACM symposium - Berkeley, California, United States (1986.05.28-1986.05.30)] Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 - Explicit expanders and the Ramanujan conjectures

✍ Lubotzky, A; Phillips, R; Sarnak, P 📂 Article 📅 1986 🏛 ACM Press ⚖ 284 KB

[ACM Press the eighteenth annual ACM sym

[ACM Press the eighteenth annual ACM symposium - Berkeley, California, United States (1986.05.28-1986.05.30)] Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 - Explicit expanders and the Ramanujan conjectures

✍ Lubotzky, A; Phillips, R; Sarnak, P 📂 Article 📅 1986 🏛 ACM Press ⚖ 284 KB

1. Background. The aim of this note is to give an explicit construction of a rich family of k-regular (except for k ° =k) of the adjacency matrix satisfy Ikjl < 2 k~-l. graphs for which all the eigenvalues kj This bound is optimal (see Proposition 2.1). We call such graphs Ramanujan graphs. These g

[ACM Press the eighteenth annual ACM sym

[ACM Press the eighteenth annual ACM symposium - Berkeley, California, United States (1986.05.28-1986.05.30)] Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 - Pseudo-random permutation generators and cryptographic composition

✍ Luby, M; Rackoff, C 📂 Article 📅 1986 🏛 ACM Press ⚖ 595 KB

[ACM Press the eighteenth annual ACM sym

[ACM Press the eighteenth annual ACM symposium - Berkeley, California, United States (1986.05.28-1986.05.30)] Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 - Almost optimal lower bounds for small depth circuits

✍ Hastad, J 📂 Article 📅 1986 🏛 ACM Press ⚖ 1006 KB

[ACM Press the eighteenth annual ACM sym

[ACM Press the eighteenth annual ACM symposium - Berkeley, California, United States (1986.05.28-1986.05.30)] Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 - Four pages are necessary and sufficient for planar graphs

✍ Yannakakis, M 📂 Article 📅 1986 🏛 ACM Press ⚖ 466 KB

[ACM Press the fourteenth annual ACM sym

[ACM Press the fourteenth annual ACM symposium - San Francisco, California, United States (1982.05.05-1982.05.07)] Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 - Decidability of reachability in vector addition systems (Preliminary Version)

✍ Kosaraju, S. Rao 📂 Article 📅 1982 🏛 ACM Press ⚖ 829 KB