Katalog der Deutschen Nationalbibliothek

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

891 - 900 von 965

	891	The domatic number problem: Boolean hierarchy completeness and exact exponential time algorithms Riege, Tobias, 2006
	892	The Kolmogorov complexity of infinite words Staiger, Ludwig. - Halle : Univ., Fachbereich Mathematik und Informatik, 2006
	893	The model data overlap Lorenz, Sönke, 2006
	894	Topics in discrete mathematics Berlin : Springer, 2006
	895	Two negative results on partial least squares path models Krämer, Nicole. - Berlin : TU, Professoren der Fak. IV, 2006
	896	Uncomputability and computational completeness below and up to the real halting problem Meer, Klaus. - Bonn : Forschungsinst. für Diskrete Mathematik, 2006
	897	Vergleich unstetiger Funktionen Mylatz, Uwe, 2006
	898	A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization Ghasemzadeh, Mohammad, 2005
	899	A non-deterministic call-by-need lambda calculus Mann, Matthias, 2005
	900	Advances in equational theorem proving Löchner, Bernd, 2005