Instytut Informatyki Analitycznej

Wydział Matematyki i Informatyki Uniwersytet Jagielloński

Seminaria

Minimum Propositional Proof Length is NP-Hard to Linearly Approximate (by Michael Alekhnovich, Sam Buss, Shlomo Morany and Toniann Pitassi)

24.02.2016

Dimension and Cut Vertices

10.02.2016

Complexity of GKS communication game

28.01.2016

On Exact Quantum Query Complexity

27.01.2016

The Linear Arboricity of Graphs

27.01.2016

Coloring graphs with many colors on cycles

21.01.2016

Data Structures on Event Graphs

20.01.2016

Some Remarks on Lengths of Propositional Proofs (by Samuel R. Buss)

20.01.2016

Matching in regular and almost regular graphs

20.01.2016

On the toric ideal of a matroid and related combinatorial problems

14.01.2016