Instytut Informatyki Analitycznej

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

Seminaria

Sparse Kneser graphs are Hamiltonian

04.04.2018

On the Complexity of Crossing Minimization

28.03.2018

Introduction to Higher-Order Categorical Logic - continuation

28.03.2018

The Matching Problem in General Graphs is in Quasi-NC

22.03.2018

Introduction to Higher-Order Categorical Logic by Lambec and Scott

21.03.2018

Punctured combinatorial Nullstellensätze

15.03.2018

Asymptotic Density and the Theory of Computability by CARL JOCKUSCH AND PAUL SCHUPP

14.03.2018

CSPs of infinite structures and equations in oligomorphic algebras

14.03.2018

On the 1/3–2/3 Conjecture

08.03.2018

Some nonstandard approaches to hard computational problems

07.03.2018