Katalog der Deutschen Nationalbibliothek

Neuigkeiten

Leichte Bedienung, intuitive Suche: Die Betaversion unseres neuen Katalogs ist online! → Zur Betaversion des neuen DNB-Katalogs

 
Neuigkeiten Donnerstag, 11. September 2025: Die Deutsche Nationalbibliothek öffnet wegen eines Beschäftigtentreffens an beiden Standorten erst um 15 Uhr. Die Ausstellungen des Deutschen Buch- und Schriftmuseums sind von 10 bis 18 Uhr geöffnet. Die Ausstellungen des Deutschen Exilarchivs 1933-1945 sind von 9 bis 21:30 Uhr geöffnet. // Thursday, 11 September 2025: The German National Library will not open until 15:00 due to a staff meeting at both locations. The exhibitions of the German Museum of Books and Writing will open from 10:00 to 18:00. The exhibitions of the German Exile Archive 1933–1945 will be open from 9:00 to 21:30.
 
 
 


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

541 - 550 von 655
<< < > >>


Artikel 541 Deterministic Chaos and Computational Complexity: the Case of Methodological Complexity Reductions
Enthalten in Journal for general philosophy of science Bd. 30, Nr. 1, date:1.1999: 87-101
Online Ressource
Artikel 542 Didactical Complexity of Computational Environments for the Learning of Mathematics
Enthalten in International journal of computers for mathematical learning Bd. 4, Nr. 1, date:10.1999: 1-26
Online Ressource
Artikel 543 On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions
Enthalten in Theory of computing systems Bd. 31, Nr. 6, date:12.1998: 679-693
Online Ressource
Artikel 544 Note on the computational complexity ofj-radii of polytopes in ℝ n
Enthalten in Mathematical programming Bd. 73, Nr. 1, date:4.1996: 1-5
Online Ressource
Artikel 545 Scheduling jobs of equal length: complexity, facets and computational results
Enthalten in Mathematical programming Bd. 72, Nr. 3, date:3.1996: 207-227
Online Ressource
Artikel 546 Computational complexity of the advancing front triangulation
Enthalten in Engineering with computers Bd. 12, Nr. 1, date:3.1996: 16-22
Online Ressource
Artikel 547 A lower bound on computational complexity given by revelation mechanisms
Enthalten in Economic theory Bd. 7, Nr. 2, date:6.1996: 237-266
Online Ressource
Artikel 548 On the computational complexity of the solution of linear systems with moduli
Enthalten in Reliable computing Bd. 2, Nr. 2, date:6.1996: 125-131
Online Ressource
Artikel 549 The computational complexity of recognizing permutation functions
Enthalten in Computational complexity Bd. 5, Nr. 1, date:3.1995: 76-97
Online Ressource
Artikel 550 On the computational complexity of the maximum trade problem
Enthalten in Acta mathematicae applicatae sinica / English series Bd. 10, Nr. 4, date:10.1994: 434-440
Online Ressource


541 - 550 von 655
<< < > >>


E-Mail-IconAdministration