Codes April 12, Sanjeev Arora, L´ aszl´ o Babai, Jacques Stern, and Z. (Elizabeth) Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear

First Page		Document Content
Date: 2014-04-12 03:21:38 Babai Symposium on Foundations of Computer Science		Codes April 12, Sanjeev Arora, L´ aszl´ o Babai, Jacques Stern, and Z. (Elizabeth) Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear Add to Reading List Source URL: people.cs.uchicago.edu Download Document from Source Website File Size: 71,94 KB Share Document on Facebook

	3. STRUCTURE MODEL AND ISOMORPHISM PROBLEM Structure model is also a canonical presentation of a graph. The problem of canonical presentation was established probably by Lazlo Babai [1, 2] in 1977th. It means the presen DocID: 1vjcF - View Document
	List of publications in reverse chronological order with clickable links L´aszl´o Babai April 11, 2014 DocID: 1sFLs - View Document
	List of my favorite publications in order of my personal preference with clickable links L´aszl´o Babai April 11, 2014 DocID: 1sDBw - View Document
	Graph Isomorphism in Quasipolynomial Time L´aszl´o Babai University of Chicago arXiv:1512.03547v1 [cs.DS] 11 Dec 2015 DocID: 1syEg - View Document
	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document