Katalog der Deutschen Nationalbibliothek

Neuigkeiten 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.
 
 
 


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

511 - 520 von 655
<< < > >>


Online Ressourcen 511 Newton's method and the computational complexity of the fundamental theorem of algebra
Batra, Prashant. - Hamburg : Universitätsbibliothek der Technischen Universität Hamburg-Harburg, 2008
Online Ressource
Artikel 512 08381 Executive Summary – Computational Complexity of Discrete Problems
Enthalten in Schloss Dagstuhl, Leibniz-Zentrum für Informatik: Dagstuhl Seminar Proceedings 2008, Volume 8381, page 1-7
Online Ressource
Artikel 513 Sample Complexity for Computational Classification Problems
Enthalten in Algorithmica Bd. 49, Nr. 1, date:9.2007: 69-77
Online Ressource
Artikel 514 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.
Online Ressource
Artikel 515 Special Issue “Conference on Computational Complexity 2006” Guest Editors’ Foreword
Enthalten in Computational complexity Bd. 16, Nr. 2, date:05.2007: 113-114
Online Ressource
Artikel 516 Special Issue “Conference on Computational Complexity 2005” Guest Editor’s Foreword
Enthalten in Computational complexity Bd. 15, Nr. 4, date:12.2006: 297
Online Ressource
Artikel 517 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.
Online Ressource
Artikel 518 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.
Online Ressource
Artikel 519 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.
Online Ressource
Artikel 520 SPECIAL ISSUE “CONFERENCE ON COMPUTATIONAL COMPLEXITY 2005” GUEST EDITOR’S FOREWORD
Enthalten in Computational complexity Bd. 15, Nr. 2, date:6.2006: 93
Online Ressource


511 - 520 von 655
<< < > >>


E-Mail-IconAdministration