2015 - Fellow of the American Academy of Arts and Sciences
His main research concerns Discrete mathematics, Combinatorics, Time complexity, Permutation group and Graph isomorphism problem. His research in Discrete mathematics intersects with topics in PH and Group. His work deals with themes such as Random seed and Pseudorandom number generator, which intersect with Combinatorics.
László Babai combines subjects such as Pseudorandom generator, Turing machine, Gas meter prover, Nondeterministic algorithm and Random graph with his study of Time complexity. His studies deal with areas such as Cyclic permutation and Degree as well as Permutation group. His Binary logarithm research incorporates themes from Randomized algorithm, Graph theory, Parallel algorithm and Maximal independent set.
His main research concerns Combinatorics, Discrete mathematics, Permutation group, Time complexity and Group. His Combinatorics research includes themes of Classification of finite simple groups and Finite group. His Group theory research extends to Discrete mathematics, which is thematically connected.
His research integrates issues of Degree, Cyclic permutation, Permutation and Algorithm in his study of Permutation group. His Time complexity research is multidisciplinary, incorporating perspectives in Mathematical proof and Turing machine. László Babai has included themes like Pseudorandom generator, Random seed and Pseudorandom number generator in his Turing machine study.
László Babai mainly focuses on Combinatorics, Discrete mathematics, Graph isomorphism, Permutation group and Isomorphism. The study incorporates disciplines such as Classification of finite simple groups and Group in addition to Combinatorics. His research on Discrete mathematics often connects related areas such as Group theory.
His Permutation group research includes elements of Conjecture, Graph property, Number theory, Prime number and Riemann hypothesis. His Isomorphism research is multidisciplinary, relying on both Graph theory, Canonical form, Permutation graph and Cyclic permutation. He studied Group isomorphism and Time complexity that intersect with Order isomorphism and Theoretical computer science.
László Babai mostly deals with Combinatorics, Discrete mathematics, Graph isomorphism, Isomorphism and Classification of finite simple groups. László Babai interconnects Group of Lie type, Order and Permutation group in the investigation of issues within Combinatorics. The various areas that László Babai examines in his Order study include Finite group, Prime factor, Prime, Alternating group and Cayley graph.
László Babai conducted interdisciplinary study in his works that combined Discrete mathematics and Bounded function. His studies in Isomorphism integrate themes in fields like Graph theory and Automorphism. His Graph theory study combines topics from a wide range of disciplines, such as Hypergraph, Computational complexity theory and Rank.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
On Lova´sz' lattice reduction and the nearest lattice point problem
L Babai;L Babai.
Trading group theory for randomness
symposium on the theory of computing (1985)
Non-deterministic exponential time has two-prover interactive protocols
L. Babai;L. Babai;L. Fortnow;C. Lund.
Computational Complexity (1992)
A fast and simple randomized parallel algorithm for the maximal independent set problem
Noga Alon;Noga Alon;Laszlo Babai;Laszlo Babai;Alon Itai;Alon Itai.
Journal of Algorithms (1985)
Checking computations in polylogarithmic time
László Babai;Lance Fortnow;Leonid A. Levin;Mario Szegedy.
symposium on the theory of computing (1991)
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
László Babai;Shlomo Moran.
symposium on the theory of computing (1988)
Canonical labeling of graphs
László Babai;Eugene M. Luks.
symposium on the theory of computing (1983)
Graph Isomorphism in Quasipolynomial Time
arXiv: Data Structures and Algorithms (2015)
Complexity classes in communication complexity theory
Laszlo Babai;Peter Frankl;Janos Simon.
foundations of computer science (1986)
BPP has subexponential time simulations unless EXPTIME has publishable proofs
László Babai;Lance Fortnow;Noam Nisan;Avi Wigderson.
Computational Complexity (1993)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: