|
721 |
Complexity of computing functions by quantum branching programs
Ablaev, Farid. - Bonn : Inst für Informatik, 2007
|
|
|
|
722 |
Complexity of the Hamiltonian cycle problem in triangular grid graphs
Gordon, Valerij S.. - Magdeburg : Univ., Fak. für Mathematik, 2007
|
|
|
|
723 |
Complexity results for boolean constraint satisfaction problems
Bauland, Michael. - Göttingen : Cuvillier, 2007, 1. Aufl.
|
|
|
|
724 |
Computability and complexity aspects of univariate complex analysis
Rettinger, Robert. - Hagen, 25. September 2007
|
|
|
|
725 |
Computational geometry and graph theory
Tokyo : Springer, 2007
|
|
|
|
726 |
Constrained planarity and augmentation problems
Percan, Merijam, 2007
|
|
|
|
727 |
Constrained random graph processes
Schlatter, Dirk, 2007
|
|
|
|
728 |
Coping with incomplete information in scheduling
Megow, Nicole. - Göttingen : Cuvillier, 2007, 1. Aufl.
|
|
|
|
729 |
Data structures for efficient string algorithms
Fischer, Johannes, 2007
|
|
|
|
730 |
Die Top Ten der schönsten mathematischen Sätze
Basieux, Pierre. - Reinbek bei Hamburg : Rowohlt-Taschenbuch-Verl., 2007, Orig.-Ausg., 6. Aufl.
|
|
Administration
