Katalog der Deutschen Nationalbibliothek

Expertensuche ?

Donnerstag, 11. September 2025: Die Deutsche Nationalbibliothek öffnet wegen eines Beschäftigtentreffens an beiden Standorten erst um 15 Uhr. // Thursday, 11 September 2025: The German National Library will not open until 15:00 due to a staff meeting at both locations.

Vom 10. September 2025, 13 Uhr, bis 11. September 2025, 22 Uhr, kann es zu Einschränkungen bei der Bereitstellung von Medienwerken kommen. Wir informieren Sie per E-Mail über den aktuellen Stand Ihrer Bestellungen. // From 13:00 on 10 September 2025 until 22:00 on 11 September 2025, there may be restrictions on the provision of media works. We will inform you by email about the current status of your orders.

Ergebnis der Suche nach: tit all "Computational complexity."
im Bestand: Gesamter Bestand

681 - 690 von 890

	681	Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity Enthalten in Reliable computing Bd. 11, Nr. 1, date:2.2005: 59-76
	682	Computational complexity of some restricted instances of 3 SAT Berman, Piotr. - Bonn : Inst. für Informatik, 2004
	683	IMRT planning on adaptive volume structures – a significant advance of computational complexity Kaiserslautern : Fraunhofer-Institut für Techno- und Wirtschaftsmathematik, Fraunhofer (ITWM), 2004
	684	The Electronic Colloquium on Computational Complexity Trier : ECCC Local Office, Univ., 2004
	685	Thinking in complexity Mainzer, Klaus. - Berlin : Springer, 2004, 4., rev. and enl. ed.
	686	Thinking in Complexity Berlin, Heidelberg : Springer Berlin Heidelberg, 2004, Fourth Revised and Enlarged Edition
	687	Computational Complexity in Algebraic Systems Enthalten in Siberian mathematical journal Bd. 45, Nr. 6, date:11.2004: 1113-1123
	688	Counting loop diagrams: computational complexity of higher-order amplitude evaluation Enthalten in The European physical journal / C / Particles and fields Bd. 36, Nr. 4, date:08.2004: 459-470
	689	On the Computational Complexity of Consumer Decision Rules Enthalten in Computational economics Bd. 23, Nr. 2, date:3.2004: 173-192
	690	On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance Enthalten in Annals of combinatorics Bd. 8, Nr. 4, date:1.2005: 409-423