Instytut Informatyki Analitycznej

Wydział Matematyki i Informatyki Uniwersytet Jagielloński

Seminaria

On the Complexity of the (Approximate) Nearest Colored Node Problem

15.11.2018

Contracting a Planar Graph Efficiently

15.11.2018

Enumerating Proofs of Positive Formulae by GILLES DOWEK AND YING JIANG

14.11.2018

New approximation algorithm for (1,2)-TSP (Adamaszek, Mnich, Paluch)

13.11.2018

Hamming distance completeness and sparse matrix multiplication

08.11.2018

On the queue-number of graphs with bounded tree-width

08.11.2018

On Randomised Strategies in the λ-Calculus by Ugo Dal Lago and Gabriele Vanoni

07.11.2018

NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors (A. Bhangale)

06.11.2018

A Hitchhiker’s Guide to descriptional complexity through analytic combinatorics by Sabine Broda, António Machiavelo, Nelma Moreira and Rogério Reis

31.10.2018

David Galvin, “Three tutorial lectures on entropy and counting” (rozdział 5)

30.10.2018