|
511 |
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains Uppman, Hannes. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014
|
|
|
512 |
On the computational complexity of partial word automata problems Holzer, Markus. - Gießen : Universitätsbibliothek, 2014
|
|
|
513 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121) Enthalten in Schloss Dagstuhl, Leibniz-Zentrum für Informatik: Dagstuhl Reports 2014, Volume 4, Issue 3, page 62-84
|
|
|
514 |
Complexity and Approximation of Fundamental Problems in Computational Convexity König, Stefan M.. - München : Universitätsbibliothek der TU München, 2013
|
|
|
515 |
Computational Steering with Reduced Complexity Butnaru, Daniel. - München : Universitätsbibliothek der TU München, 2013
|
|
|
516 |
Notions of teaching and complexity in computational learning theory Doliwa, Thorsten. - Bochum : Ruhr-Universität Bochum, 2013
|
|
|
517 |
Qualitative Reasoning about Relative Directions Lee, Jae Hee. - Bremen : Staats- und Universitätsbibliothek Bremen, 2013
|
|
|
518 |
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421) Enthalten in Schloss Dagstuhl, Leibniz-Zentrum für Informatik: Dagstuhl Reports 2013, Volume 2, Issue 10, page 60-78
|
|
|
519 |
Combinatorial and Geometric Aspects of Computational Network Construction Krug, Marcus. - Karlsruhe : KIT-Bibliothek, 2012
|
|
|
520 |
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation Baumeister, Dorothea. - Düsseldorf : Universitäts- und Landesbibliothek der Heinrich-Heine-Universität Düsseldorf, 2012
|
|