Yahoo Suche Web Suche

Suchergebnisse

  1. Suchergebnisse:
  1. 23. Aug. 2024 · László Babai. Graph Isomorphism in Quasipolynomial Time [Extended Abstract]. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC '16, pages 684-697, New York, NY, USA, 2016. Association for Computing Machinery. URL: https://doi.org/10.1145/2897518.2897542.

  2. 29. Aug. 2024 · Symmetry breaking predicates (SBPs) typically impose an order on variables and single out the lexicographic leader (lex-leader) in each orbit of assignments. Although it is NP-hard to find complete lex-leader SBPs, incomplete lex-leader SBPs are widely used in practice. In this paper, we investigate the complexity of computing ...

  3. 22. Aug. 2024 · László Babai. 2016. Graph isomorphism in quasipolynomial time. In Proc. STOC. 684–697. Google Scholar [13] Thomas Gärtner, Peter Flach, and Stefan Wrobel. 2003. On graph kernels: Hardness results and efficient alternatives. In Proc. ...

  4. 31. Aug. 2024 · Has anyone (that we know of) ever actually implemented László Babai's algorithm for graph isomorphism in quasipolynomial time?

  5. 23. Aug. 2024 · László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, and Eugene M. Luks. Multiplicative equations over commuting matrices. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '96, pages 498-507, USA, 1996. Society for Industrial and Applied Mathematics.

  6. 3. Sept. 2024 · From 2014 to 2020, he was the president of the Hungarian Academy of Sciences. In 1981, together with Paul Erdős and László Babai, he founded the journal Combinatorica, and in 1985, he co-founded the Budapest Semesters in Mathematics program for American undergraduate students.

  7. Vor 3 Tagen · László Babai: Paul Erdös (1913-1996): His Influence on the Theory of Computing.