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

691 - 700 von 890

	691	The Electronic Colloquium on Computational Complexity Trier : ECCC Local Office, Univ., 2003
	692	Computational complexity on computable metric spaces Enthalten in Mathematical logic quarterly Bd. 49, 2003, Nr. 1: 3-21. 19 S.
	693	Computational complexity and the acquisition of functional categories by French-speaking children with SLI Enthalten in Linguistics Bd. 41, 2003, Nr. 2: 175-211
	694	Computational complexity of stable partitions with B-preferences Enthalten in International journal of game theory Bd. 31, Nr. 3, date:06.2003: 353-364
	695	Two Models of Information Costs Based on Computational Complexity Enthalten in Computational economics Bd. 21, Nr. 1-2, date:2.2003: 87-105
	696	The Electronic Colloquium on Computational Complexity Trier : ECCC Local Office, Univ., 2002
	697	A New View of the Computational Complexity of IVP for ODE Enthalten in Numerical algorithms Bd. 31, Nr. 1-4, date:12.2002: 115-124
	698	Truncated Turbo Decoding with Reduced Computational Complexity Enthalten in Wireless personal communications Bd. 20, Nr. 2, date:2.2002: 101-112
	699	Coloring, computational complexity, and culture Enthalten in Deutsche Mathematiker-Vereinigung: Mitteilungen der Deutschen Mathematiker-Vereinigung Bd. 10, 2002, Nr. 1: 26-29. 4 S.
	700	Computational Complexity of Probabilistic Disambiguation Enthalten in Grammars Bd. 5, Nr. 2, date:8.2002: 125-151