×
Studying Physics Studying Mathematics Research The Faculty SL
Events News Staff Directory Timetables For staff Search

David Gajser: Neodločljivi problemi brez prevedb

Date of publication: 7. 5. 2013
Graph theory and algorithms seminar
Četrtek 9. 5. 2013 ob 12:15 v PS na Jadranski 19.
Znanih je veliko neodločljivih problemov in pri večini se neodločljivost dokaže s prevedbo iz že znanega neodločljivega problema. Neodločljivost nekaterih problemov pa gre pokazati brez prevedb ...
Bojan Mohar: Proper in-orientations of graphs
Graph theory and algorithms seminar
18. 4. 2016
Organizacija seminarja
Graph theory and algorithms seminar
6. 10. 2015
Simon Schmidt: Misère Geography and Vertex NimG are PSPACE-Hard
Graph theory and algorithms seminar
1. 6. 2015
Gašper Fijavž: Complete graph minors in even embeddings
Graph theory and algorithms seminar
25. 5. 2015
Bojan Mohar: Four-way switching equivalence and Hermitian adjacency spectrum of digraphs.
Graph theory and algorithms seminar
19. 5. 2015

All news