Заметки о Ñ€Ð°ÑÑˆÐ¸Ñ€ÑÑ‰Ð¸Ñ Ð³Ñ€Ð°Ñ„Ð°Ñ

Список литературы[HLW] S. Hoory, N. Linial, A. Wigderson. Expander graphs and theirapplications. Bulletin of the AMS, vol. 43, Number 4, Oct. 2006, pp.439–561.[AB] S. Arora, B. Barak. Computational Complexity: A modern Approach.(Draft version is available online: http://www.cs.princeton.edu/theory/complexity/)[AS] N. Alon, J. H. Spencer. The Probabilistic Method. 2nd ed. Wiley-Interscience Publication. Русский перевод: Н. Алон, Дж. Спенсер. Вероятностныйметод. Бином. Лаборатория знаний, 2007[BMRV] H. Buhrman, P.B. Miltersen, J. Radhakrishnan, S. Venkatesh. AreBitvectors optimal? SIAM J. Comput., 31(6):1723–1744, 2002.[Zem] G. Zémor. On Expander codes. IEEE Trans. on Inf. Theory. 47(2), 835–837, 2001.[Sar] P. Sarnak. Some applications of modular forms. Cambridge UniversityPress, 1990. Русский перевод: П. Сарнак. Модулярные формы и их приложения.Москва, Фазис, 1998.[Rei] O. Reingold. Undirected st-connectivity in log-space. In Proceedings of the37th Annual ACM Symposium on Theory of Computing, pages 376–385,2005.[Gu] V. Guruswami. Error-correcting Codes and Expander Graphs. SIGACTNews Complexity Theory Column 45, 2004.[Spi] D. Spielman. Constructing error-correcting codes from expander graphs.In Emerging Applications of Number Theory, IMA volumes in mathematicsand its applications, volume 109, 1996.[BSSVW] E. Ben-Sasson, M. Sudan, S. Vadhan, A. Wigderson. Randomnessefficientlow-degree tests and short PCPs via epsilon-biased sets. STOC2003, 612–621.[Gacs] P. Gács. Book chapter on reliable computation.http://www.cs.bu.edu/ gacs/papers/iv-eng.pdf42