Risultati di ricerca
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.
9 gen 2017 · Check out two of my favorite brainchildren: Contribute to Theory of Computing , a free online journal in theoretical computer science (free to readers and free to authors!), and see the number of citations to your work soar. Learn about Budapest Semesters in Mathematics, your passport to a career in mathematics.
I work in the fields of theoretical computer science and discrete mathematics; more specifically in computational complexity theory, algorithms, combinatorics, and finite groups, with an emphasis on the interactions between these fields.
I work in the fields of theoretical computer science and discrete mathematics; more specifically in computational complexity theory, algorithms, combinatorics, and finite groups, with an emphasis on the interactions between these fields.
László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun: Weights of Exact Threshold Functions. In: Proc. 35th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'10) LNCS, Springer 2010, pp. 66-77.
László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, Avi Wigderson: Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. STOC 1996 : 603-611
László Pyber Senior Research Fellow , ... S Arora, L Babai, J Stern, Z Sweedyk. Journal of Computer and System Sciences 54 (2), 317-331, 1997. 615: 1997:
