Instytut Informatyki Analitycznej

数学与计算机系 uj-lift-theme.uniwersytet-jagiellonski

Seminaria

Majority choosability of digraphs

10.10.2019

GENERIC ALGORITHMS FOR HALTING PROBLEM AND OPTIMAL MACHINES REVISITED

09.10.2019

Choosability number of planar graphs

03.10.2019

FIT 2019 – Forum Informatyki Teoretycznej 2019

06.09.2019 - 07.09.2019

Generalized Turán densities and counting cycles in graphs

19.06.2019

A Borsuk–Ulam Equivalent that Directly Implies Sperner’s Lemma

13.06.2019

Three famous theorems on finite sets

13.06.2019

Subexponential algorithms for finding large induced sparse subgraphs

12.06.2019

The Hardness of the Lemmings Game, or Oh no, more NP-Completeness Proofs

06.06.2019

Bohm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms by Richard Statman and Henk Barendregt

05.06.2019