Search results
4 days ago · László Babai. Graph isomorphism in quasipolynomial time [extended abstract]. In Daniel Wichs and Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 684-697.
4 days ago · Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher order nonlinearities of some monomial Boolean functions. We prove lower bounds on the second-order nonlinearities of ...
3 days ago · Erdős in 1992. Paul Erdős (1913–1996) was a Hungarian mathematician. He considered mathematics to be a social activity and often collaborated on his papers, having 511 joint authors, many of whom also have their own collaborators.
5 days ago · László Babai; By a result of L. Lovász, the determination of the spectrum of any graph with transitive automorphism group easily reduces to that of some Cayley graph.We derive an expression for ...
3 days ago · 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.
- Reference
3 days ago · László Babai: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. ACM 2004, ISBN 1-58113-852-0
5 days ago · László Babai: Paul Erdös (1913-1996): His Influence on the Theory of Computing.
