J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e ● C o n t e n t s ● C u r r e n t e v e n t s ● R a n d o m a r t i c l e ● A b o u t W i k i p e d i a ● C o n t a c t u s ● D o n a t e
C o n t r i b u t e
● H e l p ● L e a r n t o e d i t ● C o m m u n i t y p o r t a l ● R e c e n t c h a n g e s ● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t ● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t ● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e ● C o n t r i b u t i o n s ● T a l k
( T o p )
1 L i f e
2 W o r k
T o g g l e W o r k s u b s e c t i o n
2 . 1 G r a p h i s o m o r p h i s m i n q u a s i p o l y n o m i a l t i m e
3 H o n o r s
4 S o u r c e s
5 R e f e r e n c e s
6 E x t e r n a l l i n k s
T o g g l e t h e t a b l e o f c o n t e n t s
L á s z l ó B a b a i
1 2 l a n g u a g e s
● D e u t s c h ● E s p a ñ o l ● E s p e r a n t o ● F r a n ç a i s ● ע ב ר י ת ● ქ ა რ თ უ ლ ი ● M a g y a r ● م ص ر ى ● O ʻ z b e k c h a / ў з б е к ч а ● P o r t u g u ê s ● Р у с с к и й ● У к р а ї н с ь к а
E d i t l i n k s
● A r t i c l e ● T a l k
E n g l i s h
● R e a d ● E d i t ● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d ● E d i t ● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e ● R e l a t e d c h a n g e s ● U p l o a d f i l e ● S p e c i a l p a g e s ● P e r m a n e n t l i n k ● P a g e i n f o r m a t i o n ● C i t e t h i s p a g e ● G e t s h o r t e n e d U R L ● D o w n l o a d Q R c o d e ● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F ● P r i n t a b l e v e r s i o n
I n o t h e r p r o j e c t s
● W i k i m e d i a C o m m o n s
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
Hungarian mathematician and computer scientist
László "Laci" Babai (born July 20, 1950, in Budapest )[1] University of Chicago . His research focuses on computational complexity theory , algorithms , combinatorics , and finite groups , with an emphasis on the interactions between these fields.
In 1968, Babai won a gold medal at the International Mathematical Olympiad . Babai studied mathematics at Faculty of Science of the Eötvös Loránd University from 1968 to 1973, received a PhD from the Hungarian Academy of Sciences in 1975, and received a DSc from the Hungarian Academy of Sciences in 1984.[1] [2] algebra at Eötvös Loránd and in computer science at the University of Chicago. In 1995, he began a joint appointment in the mathematics department at Chicago and gave up his position at Eötvös Loránd.[1]
He is the author of over 180 academic papers.[1] interactive proof systems ,[3] Las Vegas algorithm ,[4] group theoretic methods in graph isomorphism testing.[4] quasipolynomial time algorithm for the graph isomorphism problem .[5] [6]
He is editor-in-chief of the refereed online journal Theory of Computing [7] Budapest Semesters in Mathematics program and first coined the name.
Graph isomorphism in quasipolynomial time [ edit ]
After announcing the result in 2015,[6] [8] [9] graph isomorphism problem can be solved in quasi-polynomial time
in 2016, at the ACM Symposium on Theory of Computing .[10] Harald Helfgott , he posted an update in 2017.[11]
In 1988, Babai won the Hungarian State Prize, in 1990 he was elected as a corresponding member of the Hungarian Academy of Sciences, and in 1994 he became a full member.[1] Budapest University of Technology and Economics awarded him an honorary doctorate.[1]
In 1993, Babai was awarded the Gödel Prize together with Shafi Goldwasser , Silvio Micali , Shlomo Moran , and Charles Rackoff , for their papers on interactive proof systems.[15]
In 2015, he was elected[16] American Academy of Arts and Sciences , and won the Knuth Prize .
Babai was an invited speaker at the International Congresses of Mathematicians in Kyoto (1990), Zürich (1994, plenary talk), and Rio de Janeiro (2018).
Sources [ edit ]
copy from Lenta.ru // texnomaniya.ru, 20 ноября 2015
Опубліковано швидкий алгоритм для задачі ізоморфізму графів Archived 2017-07-03 at the Wayback Machine // Джерело: Хабрахабр, перекладено 16 грудня 2015, 06:30
References [ edit ]
^ László Babai at the Mathematics Genealogy Project
^ Babai, László; Moran, Shlomo (1988), "Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class", J. Comput. Syst. Sci. , 36 2 ): 254–276, doi :10.1016/0022-0000(88 )90028-1
^ a b Babai, László (1979), Monte-Carlo algorithms in graph isomorphism testing (PDF) , Tech. Report, Université de Montréal
^ Cho, Adrian (November 10, 2015), "Mathematician claims breakthrough in complexity theory", Science doi :10.1126/science.aad7416
^ a b Klarreich, Erica (14 December 2015). "Landmark Algorithm Breaks 30-Year Impasse" . Quanta Magazine the original on 2016-01-21.
^ Theory of Computing editors
^ A Big Result On Graph Isomorphism // November 4, 2015, A Fast Graph Isomorphism Algorithm // November 11, 2015
^ Claimed Breakthrough Slays Classic Computing Problem Archived 2016-01-22 at the Wayback Machine // MIT Technology Review, by Tom Simonite on November 13, 2015
^ Babai, László (2016), "Graph Isomorphism in Quasipolynomial Time [Extended Abstract]", Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC '16) , New York, NY, USA: ACM, pp. 684–697, arXiv :1512.03547 doi :10.1145/2897518.2897542 , ISBN 978-1-4503-4132-5 S2CID 17118954
^ László Babai: Fixing the UPCC case of Split-or-Johnson , posted on 14 January 2017
^ Definition 2.3. String IsomorphismTransactions on Computational Science V . Special Issue on Cognitive Knowledge Representation . Editors-in-Chief: Marina L. Gavrilova , C. J. Kenneth Tan. Editors: Yingxu Wang, Keith Chan] / Lecture Notes in Computer Science / Volume 5540, Springer Verlag , 2009
^ Coset intersection problem // The Group Properties Wiki (beta)
^ Complexity of the coset intersection problem // Theoretical Computer Science Stack Exchange, asked Sep 25 2014 at 9:43
^ 1993 Gödel Prize Archived 2015-12-08 at the Wayback Machine , ACM SIGACT , retrieved 2010-08-14.
^ American Academy of Arts and Sciences . 2015 Fellows and Their Affiliations
External links [ edit ]
t
e
1990s
2000s
2010s
2020s
t
e
1990s
2000s
2010s
2020s
International
National
Academics
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=László_Babai&oldid=1221840043 " C a t e g o r i e s : ● 1 9 5 0 b i r t h s ● 2 0 t h - c e n t u r y H u n g a r i a n m a t h e m a t i c i a n s ● 2 1 s t - c e n t u r y H u n g a r i a n m a t h e m a t i c i a n s ● H u n g a r i a n c o m p u t e r s c i e n t i s t s ● M e m b e r s o f t h e H u n g a r i a n A c a d e m y o f S c i e n c e s ● A c a d e m i c s t a f f o f E ö t v ö s L o r á n d U n i v e r s i t y ● C o m b i n a t o r i a l i s t s ● T h e o r e t i c a l c o m p u t e r s c i e n t i s t s ● U n i v e r s i t y o f C h i c a g o f a c u l t y ● G ö d e l P r i z e l a u r e a t e s ● K n u t h P r i z e l a u r e a t e s ● H u n g a r i a n e m i g r a n t s t o t h e U n i t e d S t a t e s ● L i v i n g p e o p l e ● I n t e r n a t i o n a l M a t h e m a t i c a l O l y m p i a d p a r t i c i p a n t s ● F e l l o w s o f t h e A m e r i c a n A c a d e m y o f A r t s a n d S c i e n c e s ● E ö t v ö s L o r á n d U n i v e r s i t y a l u m n i H i d d e n c a t e g o r i e s : ● W e b a r c h i v e t e m p l a t e w a y b a c k l i n k s ● A r t i c l e s w i t h s h o r t d e s c r i p t i o n ● S h o r t d e s c r i p t i o n m a t c h e s W i k i d a t a ● A r t i c l e s w i t h h C a r d s ● C o m m o n s c a t e g o r y l i n k i s o n W i k i d a t a ● A r t i c l e s w i t h I S N I i d e n t i f i e r s ● A r t i c l e s w i t h V I A F i d e n t i f i e r s ● A r t i c l e s w i t h W o r l d C a t E n t i t i e s i d e n t i f i e r s ● A r t i c l e s w i t h G N D i d e n t i f i e r s ● A r t i c l e s w i t h J 9 U i d e n t i f i e r s ● A r t i c l e s w i t h A C M - D L i d e n t i f i e r s ● A r t i c l e s w i t h D B L P i d e n t i f i e r s ● A r t i c l e s w i t h G o o g l e S c h o l a r i d e n t i f i e r s ● A r t i c l e s w i t h M A T H S N i d e n t i f i e r s ● A r t i c l e s w i t h M G P i d e n t i f i e r s ● A r t i c l e s w i t h Z B M A T H i d e n t i f i e r s
● T h i s p a g e w a s l a s t e d i t e d o n 2 M a y 2 0 2 4 , a t 0 8 : 3 8 ( U T C ) . ● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n . ● P r i v a c y p o l i c y ● A b o u t W i k i p e d i a ● D i s c l a i m e r s ● C o n t a c t W i k i p e d i a ● C o d e o f C o n d u c t ● D e v e l o p e r s ● S t a t i s t i c s ● C o o k i e s t a t e m e n t ● M o b i l e v i e w
time. The best previous bound for GI was
where
is the number of vertices (Luks, 1983); for the other two problems, the bound was similar,
where
