Katalog der Deutschen Nationalbibliothek

Ergebnis der Suche nach: dcs=511*
im Bestand: Gesamter Bestand

741 - 750 von 991

	741	Collective graph exploration Dynia, Mirosław, 2007
	742	Complexity of computing functions by quantum branching programs Ablaev, Farid. - Bonn : Inst für Informatik, 2007
	743	Complexity of the Hamiltonian cycle problem in triangular grid graphs Gordon, Valerij S.. - Magdeburg : Univ., Fak. für Mathematik, 2007
	744	Complexity results for boolean constraint satisfaction problems Bauland, Michael. - Göttingen : Cuvillier, 2007, 1. Aufl.
	745	Computability and complexity aspects of univariate complex analysis Rettinger, Robert. - Hagen, 25. September 2007
	746	Computational geometry and graph theory Tokyo : Springer, 2007
	747	Constrained planarity and augmentation problems Percan, Merijam, 2007
	748	Constrained random graph processes Schlatter, Dirk, 2007
	749	Coping with incomplete information in scheduling Megow, Nicole. - Göttingen : Cuvillier, 2007, 1. Aufl.
	750	Data structures for efficient string algorithms Fischer, Johannes, 2007