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

641 - 650 von 861

	641	Sample Complexity for Computational Classification Problems Enthalten in Algorithmica Bd. 49, Nr. 1, date:9.2007: 69-77
	642	Calude, C.: Theories of Computational Complexity. (Annals of Discrete Mathematics, 35.) North Holland, Amsterdam 1988, XI, 487 pp., $97.50; Dfl. 200.— ISBN 0‐444‐70356‐X Enthalten in Biometrical journal Bd. 32, 2007, Nr. 6: 760-760. 1 S.
	643	Special Issue “Conference on Computational Complexity 2006” Guest Editors’ Foreword Enthalten in Computational complexity Bd. 16, Nr. 2, date:05.2007: 113-114
	644	Special Issue “Conference on Computational Complexity 2005” Guest Editor’s Foreword Enthalten in Computational complexity Bd. 15, Nr. 4, date:12.2006: 297
	645	Complexity in Modeling and Understanding Protonation States: Computational Titration of HIV‐1‐Protease–Inhibitor Complexes Enthalten in Chemistry & biodiversity Bd. 4, 2007, Nr. 11: 2564-2577. 14 S.
	646	Special issue / Conference on Computational Complexity 2005 Conference on Computational Complexity (20 : 2005 : San José, Calif.). - Basel : Birkhäuser, 2006
	647	Implementation complexity of physical processes as a natural extension of computational complexity Enthalten in Fortschritte der Physik Bd. 54, 2006, Nr. 8‐10: 882-897. 16 S.
	648	DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY Enthalten in Mathematical logic quarterly Bd. 30, 2006, Nr. 32‐34: 499-503. 5 S.
	649	SPECIAL ISSUE “CONFERENCE ON COMPUTATIONAL COMPLEXITY 2005” GUEST EDITOR’S FOREWORD Enthalten in Computational complexity Bd. 15, Nr. 2, date:6.2006: 93
	650	Algebraic methods in computational complexity [Wadern] : [Internat. Begegnungs- und Forschungszentrum für Informatik], [2005]