Skip to primary content

Bucktown Bell

Cut to the chase.

Bucktown Bell

Main menu

  • Home
  • Baseball Analytics
  • Contact Me

Post navigation

← Previous Next →

Shtetl-Optimized

Posted on November 6, 2015 by mea

According to the University of Chicago’s theory seminar calendar, on Tuesday of next week (November 10), the legendary Laszlo Babai will be giving a talk about a new algorithm that solves the graph isomorphism problem in quasipolynomial time.

Source: Shtetl-Optimized » Blog Archive » G. Phi. Fo. Fum.

This entry was posted in STEM and tagged algorithms, graph theory, mathematics, np problem by mea. Bookmark the permalink.
Proudly powered by WordPress