Katalog der Deutschen Nationalbibliothek

Neuigkeiten

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

 
 
 


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

741 - 750 von 773
<< < > >>


Artikel 741 Modeling complexity: cognitive constraints and computational model-building in integrative systems biology
Enthalten in History and philosophy of the life sciences Bd. 40, 8.1.2018, Nr. 1, date:3.2018: 1-28
Online Ressource
Artikel 742 On computational complexity of the electric power flow optimization problem in market environment
Enthalten in Journal of applied and industrial mathematics Bd. 11, 26.11.2017, Nr. 4, date:10.2017: 500-505
Online Ressource
Artikel 743 On the Computational Complexity of Best L 1 ‐approximation
Enthalten in Mathematical logic quarterly Bd. 48, 2002, Nr. S1, Mathematical Logic Quarterly/Supplement 1 1: 66-77. 12 S.
Online Ressource
Artikel 744 On the Computational Complexity of Compressed Power Series
Enthalten in Mathematical notes Bd. 114, 24.8.2023, Nr. 1-2, date:8.2023: 92-98
Online Ressource
Artikel 745 On the computational complexity of curing non-stoquastic Hamiltonians
Enthalten in Nature Communications Bd. 10, 5.4.2019, Nr. 1, date:12.2019: 1-9
Online Ressource
Artikel 746 On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
Enthalten in Theory of computing systems Bd. 66, 11.5.2022, Nr. 3, date:6.2022: 519-545
Online Ressource
Artikel 747 On the computational complexity of ethics: moral tractability for minds and machines
Enthalten in Artificial intelligence review Bd. 57, 31.3.2024, Nr. 4, date:4.2024: 1-90
Online Ressource
Artikel 748 On the computational complexity of finding a sparse Wasserstein barycenter
Enthalten in Journal of combinatorial optimization Bd. 41, 3.3.2021, Nr. 3, date:4.2021: 736-761
Online Ressource
Artikel 749 On the computational complexity of Roman $$\2\}$$ 2 } -domination in grid graphs
Enthalten in Journal of combinatorial optimization Bd. 45, 14.4.2023, Nr. 3, date:4.2023: 1-10
Online Ressource
Artikel 750 On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model
Enthalten in Algorithms for molecular biology Bd. 12, 14.3.2017, Nr. 1, date:12.2017: 1-12
Online Ressource


741 - 750 von 773
<< < > >>




Materialarten

Alle MaterialartenOnline Ressourcen (773)

Kataloge/Sammlungen

Alle Kataloge/Sammlungen

Standorte

Alle StandorteLeipzig (773)

E-Mail-IconAdministration