Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/László_Babai> ?p ?o }
- László_Babai abstract "László \"Laci\" Babai (born July 20, 1950 in Budapest) is a Hungarian professor of computer science and mathematics at the University of Chicago. His research focuses on computational complexity theory, algorithms, combinatorics, and finite groups, with an emphasis on the interactions between these fields.".
- László_Babai almaMater Hungarian_Academy_of_Sciences.
- László_Babai award Gödel_Prize.
- László_Babai award Knuth_Prize.
- László_Babai birthDate "1950-07-20".
- László_Babai birthPlace Budapest.
- László_Babai doctoralAdvisor Pál_Turán.
- László_Babai doctoralAdvisor Vera_T._Sós.
- László_Babai doctoralStudent Gábor_Tardos.
- László_Babai doctoralStudent José_Augusto_Ramos_Soares.
- László_Babai doctoralStudent Lajos_Rónyai.
- László_Babai doctoralStudent Mario_Szegedy.
- László_Babai doctoralStudent Péter_Hajnal.
- László_Babai field Computer_science.
- László_Babai field Mathematics.
- László_Babai nationality Hungary.
- László_Babai thumbnail Laszlo_Babai.jpg?width=300.
- László_Babai wikiPageExternalLink mathematician-claims-breakthrough-complexity-theory.
- László_Babai wikiPageExternalLink 20151214-graph-isomorphism-algorithm.
- László_Babai wikiPageExternalLink publications.html?extend=1&pg1=IID&r=1&s1=28760.
- László_Babai wikiPageExternalLink Babai:L=aacute=szl=oacute=.html.
- László_Babai wikiPageExternalLink 273231.
- László_Babai wikiPageExternalLink opublkovano-shvidkiy-algoritm-dlya-zadach-zomorfzmu-grafv.html.
- László_Babai wikiPageExternalLink a-quasipolynomial-time-algorithm-for-graph-isomorphism-the-details.
- László_Babai wikiPageExternalLink graphtheory.
- László_Babai wikiPageExternalLink math.
- László_Babai wikiPageExternalLink ~laci.
- László_Babai wikiPageExternalLink babaiy-priblizilsya-k-resheniyu-problemi-tisyacheletiya.
- László_Babai wikiPageExternalLink professor-l%C3%A1szl%C3%B3-babai%E2%80%99s-algorithm-next-big-step-conquering-isomorphism-graphs.
- László_Babai wikiPageExternalLink a-little-more-on-the-graph-isomorphism-algorithm.
- László_Babai wikiPageID "3461604".
- László_Babai wikiPageLength "12350".
- László_Babai wikiPageOutDegree "62".
- László_Babai wikiPageRevisionID "706440146".
- László_Babai wikiPageWikiLink Algorithm.
- László_Babai wikiPageWikiLink American_Academy_of_Arts_and_Sciences.
- László_Babai wikiPageWikiLink ArXiv.
- László_Babai wikiPageWikiLink Budapest.
- László_Babai wikiPageWikiLink Budapest_Semesters_in_Mathematics.
- László_Babai wikiPageWikiLink Budapest_University_of_Technology_and_Economics.
- László_Babai wikiPageWikiLink Category:1950_births.
- László_Babai wikiPageWikiLink Category:20th-century_mathematicians.
- László_Babai wikiPageWikiLink Category:21st-century_mathematicians.
- László_Babai wikiPageWikiLink Category:Combinatorialists.
- László_Babai wikiPageWikiLink Category:Gödel_Prize_laureates.
- László_Babai wikiPageWikiLink Category:Hungarian_academics.
- László_Babai wikiPageWikiLink Category:Hungarian_computer_scientists.
- László_Babai wikiPageWikiLink Category:Hungarian_emigrants_to_the_United_States.
- László_Babai wikiPageWikiLink Category:Hungarian_mathematicians.
- László_Babai wikiPageWikiLink Category:International_Mathematical_Olympiad_participants.
- László_Babai wikiPageWikiLink Category:Living_people.
- László_Babai wikiPageWikiLink Category:Members_of_the_Hungarian_Academy_of_Sciences.
- László_Babai wikiPageWikiLink Category:Theoretical_computer_scientists.
- László_Babai wikiPageWikiLink Category:University_of_Chicago_faculty.
- László_Babai wikiPageWikiLink Charles_Rackoff.
- László_Babai wikiPageWikiLink Combinatorics.
- László_Babai wikiPageWikiLink Computational_complexity_theory.
- László_Babai wikiPageWikiLink Computer_science.
- László_Babai wikiPageWikiLink En:American_Association_for_the_Advancement_of_Science.
- László_Babai wikiPageWikiLink Eugene_M._Luks.
- László_Babai wikiPageWikiLink Eötvös_Loránd_University.
- László_Babai wikiPageWikiLink Finite_group.
- László_Babai wikiPageWikiLink Graph_isomorphism.
- László_Babai wikiPageWikiLink Graph_isomorphism_problem.
- László_Babai wikiPageWikiLink Group_theory.
- László_Babai wikiPageWikiLink Gábor_Tardos.
- László_Babai wikiPageWikiLink Gödel_Prize.
- László_Babai wikiPageWikiLink Hungarian_Academy_of_Sciences.
- László_Babai wikiPageWikiLink Hungary.
- László_Babai wikiPageWikiLink Interactive_proof_system.
- László_Babai wikiPageWikiLink Johnson_graph.
- László_Babai wikiPageWikiLink José_Augusto_Ramos_Soares.
- László_Babai wikiPageWikiLink Knuth_Prize.
- László_Babai wikiPageWikiLink Lajos_Rónyai.
- László_Babai wikiPageWikiLink Las_Vegas_algorithm.
- László_Babai wikiPageWikiLink Mario_Szegedy.
- László_Babai wikiPageWikiLink Mathematics.
- László_Babai wikiPageWikiLink Pál_Turán.
- László_Babai wikiPageWikiLink Péter_Hajnal.
- László_Babai wikiPageWikiLink Shafi_Goldwasser.
- László_Babai wikiPageWikiLink Shlomo_Moran.
- László_Babai wikiPageWikiLink Silvio_Micali.
- László_Babai wikiPageWikiLink Theory_of_Computing.
- László_Babai wikiPageWikiLink Time_complexity.
- László_Babai wikiPageWikiLink University_of_Chicago.
- László_Babai wikiPageWikiLink Vera_T._Sós.
- László_Babai wikiPageWikiLinkText "Babai László".
- László_Babai wikiPageWikiLinkText "Babai".
- László_Babai wikiPageWikiLinkText "Babai, László".
- László_Babai wikiPageWikiLinkText "László Babai".
- László_Babai almaMater Hungarian_Academy_of_Sciences.
- László_Babai awards Gödel_Prize.
- László_Babai awards Knuth_Prize.
- László_Babai birthDate "1950-07-20".
- László_Babai birthPlace Budapest.
- László_Babai content "The algorithm builds on Luks's SI framework and attacks the barrier configurations for Luks's algorithm by group theoretic «local certificates» and combinatorial canonical partitioning techniques. We show that in a well-defined sense, Johnson graphs are the only obstructions to effective canonical partitioning.".
- László_Babai content "We show that the Graph Isomorphism (GI) problem and the related problems of String Isomorphism and Coset Intersection can be solved in quasipolynomial time. The best previous bound for GI was where is the number of vertices ; for the other two problems, the bound was similar, where is the size of the permutation domain .".
- László_Babai doctoralAdvisor Pál_Turán.
- László_Babai doctoralAdvisor Vera_T._Sós.
- László_Babai doctoralStudents Gábor_Tardos.