Meetings/Workshops on Information Theory, Foundations of Computer Science in Canada

Banff International Research Station for Mathematical Innovation and Discovery (BIRS)

The researchers participating in this workshop come from several mathematical subdisciplines, including combinatorics, algebraic geometry, and theoretical computer science. Their work and common interest here is to investigate new interactions between discrete mathematics, algebra, algebraic geometry, tropical geometry, and combinatorial algorithms. Some participants have collaborated before in smaller groups, but this meeting will provide an opportunity to work together more intensively. Several recent mathematical breakthroughs will be highlighted in the workshop, including the recent resolution of some long-standing open problems about graphs and matroids. These breakthroughs used a surprising combination of interdisciplinary techniques which the organizers expect to have exciting further applications.

Courses and Events for Math Students and Early Career Researchers,    Graph Theory and Combinatorics

The Fields Institute for Research in Mathematical Sciences

The conference aims to foster research in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. Typical models include deterministic, nondeterministic, randomized, and quantum models; uniform and nonuniform models; Boolean, algebraic, and continuous models. Typical resource constraints involve time, space, randomness, program size, input queries, communication, and entanglement; worst-case as well as average case. Other, more specific, topics include: probabilistic and interactive proof systems, inapproximability, proof complexity, descriptive complexity, and complexity-theoretic aspects of cryptography and machine learning. The conference also encourages results from other areas of computer science and mathematics motivated by computational complexity theory.