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

671 - 680 von 774

	671	Some results on the computational complexity of symmetric connectionist networks Enthalten in Annals of mathematics and artificial intelligence Bd. 9, Nr. 3-4, date:9.1993: 327-344
	672	A modal perspective on the computational complexity of attribute value grammar Enthalten in Journal of logic, language and information Bd. 2, Nr. 2, date:6.1993: 129-169
	673	Kolmogorov Complexity and Computational Complexity Berlin, Heidelberg : Springer Berlin Heidelberg, 1992
	674	The computational complexity of multi-level linear programs Enthalten in Annals of operations research Bd. 34, Nr. 1, date:12.1992: 13-19
	675	On the Computational Complexity of Approximating Distributions by Probabilistic Automata Enthalten in Machine learning Bd. 9, Nr. 2-3, date:7.1992: 205-260
	676	On the computational complexity of approximating distributions by probabilistic automata Enthalten in Machine learning Bd. 9, Nr. 2-3, date:7.1992: 205-260
	677	Computational complexity and constraint logic programming languages Enthalten in Annals of mathematics and artificial intelligence Bd. 5, Nr. 2-4, date:6.1992: 163-189
	678	Computational complexity Cham (ZG) : Springer International Publishing AG
	679	Single-exception sorting networks and the computational complexity of optimal sorting network verification Enthalten in Theory of computing systems Bd. 23, Nr. 1, date:12.1990: 81-93
	680	Computational complexity of norm-maximization Enthalten in Combinatorica Bd. 10, Nr. 2, date:6.1990: 203-225