Yahoo Search Busca da Web

Entrar

Resultado da Busca

  1. link.springer.com › article › 10Limits of Preprocessing | computational complexity - Springer

    23 de mai. de 2024 · László Babai, Peter Frankl & Janos Simon (1986). Complexity classes in communication complexity theory (preliminary version). In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986, 337-347.

  2. drops.dagstuhl.de › entities › documentCanonizing Graphs of Bounded Rank-Width in Parallel via ...

    Há 3 dias · László Babai. Canonical form for graphs in quasipolynomial time: Preliminary report. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pages 1237-1246, New York, NY, USA, 2019.

  3. Imagens

    • László Babai - Alchetron, The Free Social Encyclopedia
    • "Graph Isomorphism in Quasipolynomial Time I" Seminar Lecture by László ...
    • Computer Scientists and Mathematicians Are Stunned by This Chicago ...
    • László Babai - Alchetron, The Free Social Encyclopedia

    Ver tudo

  4. dblp.org › db › confSymposium on the Theory of Computing (STOC) - dblp

    24 de mai. de 2024 · 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. 35th ...

  5. brilliant.org › wiki › randomized-algorithms-overviewRandomized Algorithms | Brilliant Math & Science Wiki

    The term for this algorithm, Las Vegas, is attributed to mathematician Laszlo Babai, who coined it in 1979 simply as a parallel to the much older Monte Carlo algorithm, as both are major world gambling centers.

  6. Vídeos

    Ver tudo

  7. dl.acm.org › doi › pdfEfficient Exact Subgraph Matching via GNN-Based Path ...

    Há 4 dias · László Babai. 2018. Group, graphs, algorithms: the graph isomorphism problem. In Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018.

  8. dblp.org › db › confdblp: 24. FOCS 1983: Tucson, Arizona, USA

    22 de mai. de 2024 · László Babai, William M. Kantor, Eugene M. Luks: Computational Complexity and the Classification of Finite Simple Groups.

  9. dblp.org › db › confdblp: STOC 2009

    15 de mai. de 2024 · Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. ACM 2009, ISBN 978-1-60558-506-2. Avi Wigderson: The work of Leslie Valiant. 1-2.