Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Bakibayev, Timur"'
Autor:
Narbayeva, Saltanat, Bakibayev, Timur, Abeshev, Kuanysh, Makarova, Irina, Shubenkova, Ksenia, Pashkevich, Anton
Publikováno v:
In Transportation Research Procedia 2020 44:168-175
Autor:
Ambos-Spies, Klaus, Bakibayev, Timur
Publikováno v:
In Theoretical Computer Science 8 July 2013 494:2-12
Autor:
Ambos-Spies, Klaus1 (AUTHOR), Bakibayev, Timur2 (AUTHOR) timurbakibayev@gmail.com
Publikováno v:
Theory of Computing Systems. Aug2019, Vol. 63 Issue 6, p1388-1412. 25p.
Autor:
Ambos-Spies, Klaus1 ambos@math.uni-heidelberg.de, Bakibayev, Timur2
Publikováno v:
Theory of Computing Systems. Jul2012, Vol. 51 Issue 1, p106-122. 17p.
Autor:
Bakibayev, Timur
The standard way for proving a problem to be intractable is to show that the problem is hard or complete for one of the standard complexity classes containing intractable problems. Lutz (1995) proposed a generalization of this approach by introducing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5f8470acf20bf4d588487ef781f803c
http://archiv.ub.uni-heidelberg.de/volltextserver/10499/
http://archiv.ub.uni-heidelberg.de/volltextserver/10499/
Publikováno v:
Embracing Global Computing in Emerging Economies; 2015, p54-63, 10p
Autor:
Ambos-Spies, Klaus, Bakibayev, Timur
Publikováno v:
Automata, Languages & Programming (9783642141645); 2010, p503-514, 12p
Autor:
Ambos-Spies, Klaus, Bakibayev, Timur
Publikováno v:
Theory & Applications of Models of Computation (9783642135613); 2010, p84-93, 10p