Babai, Laszlo

Laszlo Babai
Laszlo Babai
Date of Birth
Place of Birth	;
A country	;
Scientific field
Place of work	;
Alma mater	;
supervisor
Awards and prizes	Gödel Prize ( 1993 ) Knut Award ( 2015 )
Site

Laszlo Babai ( Hungarian Babai László ; born July 20, 1950 , Budapest ) ^[2] is a Hungarian and American scientist, professor of mathematics and computer science at the University of Chicago . His research focuses on the following areas: computational complexity theory, algorithm theory , combinatorics , and finite groups with an emphasis on the interaction between these industries. Author of more than 180 scientific papers. ^[2]

Biography

Babai studied mathematics at the Laund Etvös University of Budapest from 1968 to 1973, received a Ph.D. in the Hungarian Academy of Sciences in 1975, and received D.Sc. in the Hungarian Academy of Sciences in 1984. ^[2] ^[3] He has worked in the USA since 1987.

The author of the algorithm is Las Vegas (1979), a version of the Monte Carlo method . ^[four]

Graph Isomorphism in Quasipolynomial Time

From November 10 to December 1, 2015, at the Combinatorics and Theoretical Computer Science seminar at the University of Chicago, he gave three presentations “Graph Isomorphism in Quasipolynomial Time ”, in which he outlined an algorithm that solves the graph isomorphism for quasi-polynomial $\exp \left(P\left(\log(n)\right)\right)$ ${\ displaystyle \ exp \ left (P \ left (\ log (n) \ right) \ right)}$ $\exp \left(P\left(\log(n)\right)\right)$ time period where $\displaystyle n\ -$ ${\ displaystyle \ displaystyle n \ -}$ $\displaystyle n\ -$ number of vertices $P\left(\log(n)\right)\ -$ ${\ displaystyle P \ left (\ log (n) \ right) \ -}$ $P\left(\log(n)\right)\ -$ polynomial from $\log(n)$ ${\ displaystyle \ log (n)}$ $\log(n)$ . ^[5] ^[6] ^[7] ^[8]

December 10, 2015 video of the first report was published ^[9] .

December 11, 2015 in arXiv.org published the eponymous article "Graph Isomorphism in Quasipolynomial Time" ^[10] .

abstract

We show that the Isomorphism Isomorphism ^[11] (under action group) (SI) and the Coset Intersection ( ¹²⁾ ^[13] ^[12] ^[13]
$\exp \left(\left(\log n\right)^{O\left(1\right)}\right)$ ${\ displaystyle \ exp \ left (\ left (\ log n \ right) ^ {O \ left (1 \ right)} \ right)}$
time. GI was
$\exp \left(O\left({\sqrt {n\log n}}\right)\right)$ ${\ displaystyle \ exp \ left (O \ left ({\ sqrt {n \ log n}} \ right) \ right)}$
where $n$ ${\ displaystyle n}$ is the number of vertices ( , 1983); for the other two problems, the bound was similar,
$\quad \qquad \exp \left({\tilde {O}}\left({\sqrt {n}}\right)\right)$ ${\ displaystyle \ quad \ qquad \ exp \ left ({\ tilde {O}} \ left ({\ sqrt {n}} \ right) \ right)}$
where $n$ ${\ displaystyle n}$ is the size of the permutation domain (Babai, 1983).

The algorithm of the development of the strategy and the configurations of the team of scientists of are what we can understand and canonical partitioning.

Notes

↑ http://news.uchicago.edu/profile/laszlo-babai
↑ ¹ ² ³ Curriculum vitae Archived February 11, 2014. // Babai's web site
↑ Babai, Laszlo (English) in the project “ Mathematical Genealogy ”
Л “'Laszlo Babai' ', Monte-Carlo algorithms in graph isomorphism testing , Université de Montréal, DMS No. 79-10.
↑ Laszlo Babai (University of Chicago): Graphic Ideomorphism in Quasipolynomial Time I : The “Local Certificates Algorithm” // Combinatorics and Theoretical Computer Science seminar, November 10, 2015, 15:00 - 16:00
↑ A Big Result On Graph Isomorphism // November 4, 2015, A Fast Graph Isomorphism Algorithm // November 11, 2015
↑ Combinatorics and Theoretical Computer Science Archived December 22, 2015. calendar // Theoretical Computer Science at the University of Chicago . November 24, 2015, Laszlo Babai (University of Chicago): Combinatorics and TCS seminar "Graphic of the Quasipolynomial Time II: The Split-or-Johnson routine"
Imed Claimed Breakthrough Slays Classic Computing Problem // MIT Technology Review, by Tom Simonite on November 13, 2015
Is Graphic Isomorphism in Quasipolynomial Time I , lecture lectured by László Babai on November 10, 2015. The University of Chicago // youtube, 1 hour. 40 min Published December 10, 2015
↑ László Babai. Graph Isomorphism in Quasipolynomial Time , 84 pages / abstract // arXiv.org > cs> arXiv: 1512.03547 / version 1 [v1] Fri, 11 Dec 2015 08:04:26 GMT GMT
↑ "'Definition 2.3."' String Isomorphism // Google Books, in: Transactions on Computational Science V. Special Issue on Cognitive Knowledge Representation. Editors-in-Chief: Marina L. Gavrilova, CJ Kenneth Tan. Editors: Yingxu Wang, Keith Chan / / Volume 5540, Springer Verlag , 2009
↑ Coset intersection problem // The Group Properties Wiki (beta)
↑ Complexity of the coset intersection problem // Theoretical Computer Science Stack Exchange
Graph Isomorphism Problem // ibid.
Complexity of simple undirected graph isomorphism problem // ibid.

Links

Professor László Babai’s algorithm is next big step in conquering isomorphism in graphs // Published on Nov 20, 2015 Division of Physical Sciences / University of Chicago
Mathematician claims breakthroughs in dividing up , by Adrian Cho 10 November 2015 17:45 // Posted in Math , Science AAAS News
A Quasipolynomial Time Algorithm for Graph: Isomorphism: The Details + Background on the Graph Isomorphism + The Main Result // Math ∩ Programming. Posted on November 12, 2015 by j2kun
Landmark Algorithm Breaks 30-Year Impasse , Algorithm Solves Graph Isomorphism in Record Time // Quanta Magazine. By: Erica Klarreich, December 14, 2015
A Little More on the Graph Isomorphism Algorithm // November 21, 2015, by RJLipton + KWRegan (Ken Regan and Dick Lipton)
[Laszlo] Babay approached the solution of the “millennium problem” // Science Lenta.ru, 14:48, November 20, 2015

copy from Lenta.ru // texnomaniya.ru, November 20, 2015

Fast algorithm for graph isomorphism problem published // Anatoly Alizar, Habrahabr, December 16 at 02:12

Fast algorithm for graph isomorphism problem published // Source: Habrahabr, translated December 16, 2015, 06:30

[_2c79634af4bc3d1c-1] ttp://news.uchicago.edu/profile/laszlo-babai

[cv-2] ¹ ² ³ Curriculum vitae Archived February 11, 2014. // Babai's web site

[3] Babai, Laszlo (English) in the project “ Mathematical Genealogy ”

[4] Л “'Laszlo Babai' ', Monte-Carlo algorithms in graph isomorphism testing , Université de Montréal, DMS No. 79-10.

[5] Laszlo Babai (University of Chicago): Graphic Ideomorphism in Quasipolynomial Time I : The “Local Certificates Algorithm” // Combinatorics and Theoretical Computer Science seminar, November 10, 2015, 15:00 - 16:00

[6] A Big Result On Graph Isomorphism // November 4, 2015, A Fast Graph Isomorphism Algorithm // November 11, 2015

[7] Combinatorics and Theoretical Computer Science Archived December 22, 2015. calendar // Theoretical Computer Science at the University of Chicago . November 24, 2015, Laszlo Babai (University of Chicago): Combinatorics and TCS seminar "Graphic of the Quasipolynomial Time II: The Split-or-Johnson routine"

[8] Imed Claimed Breakthrough Slays Classic Computing Problem // MIT Technology Review, by Tom Simonite on November 13, 2015

[9] Is Graphic Isomorphism in Quasipolynomial Time I , lecture lectured by László Babai on November 10, 2015. The University of Chicago // youtube, 1 hour. 40 min Published December 10, 2015

[10] László Babai. Graph Isomorphism in Quasipolynomial Time , 84 pages / abstract // arXiv.org > cs> arXiv: 1512.03547 / version 1 [v1] Fri, 11 Dec 2015 08:04:26 GMT GMT

[11] "'Definition 2.3."' String Isomorphism // Google Books, in: Transactions on Computational Science V. Special Issue on Cognitive Knowledge Representation. Editors-in-Chief: Marina L. Gavrilova, CJ Kenneth Tan. Editors: Yingxu Wang, Keith Chan / / Volume 5540, Springer Verlag , 2009

[12] Coset intersection problem // The Group Properties Wiki (beta)

[13] Complexity of the coset intersection problem // Theoretical Computer Science Stack Exchange
Graph Isomorphism Problem // ibid.
Complexity of simple undirected graph isomorphism problem // ibid.

Babai, Laszlo

Biography

Graph Isomorphism in Quasipolynomial Time

See also

Notes

Links

More articles: