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

91 - 100 von 655
<< < > >>


Artikel 91 Computational Complexity for Simplified Universal Filtered Multi-Carrier (UFMC) Wireless Transmitter
Enthalten in National Academy of Sciences, India: National Academy science letters 4.11.2024: 1-5
Online Ressource
Artikel 92 Computational complexity of Turning Tiles
Enthalten in International journal of game theory 22.10.2024: 1-12
Online Ressource
Artikel 93 The computational complexity of finding stationary points in non-convex optimization
Enthalten in Mathematical programming 27.9.2024: 1-61
Online Ressource
Artikel 94 Computational analysis of knowledge and complexity trends in educational technology research titles from 1927 to 2023
Enthalten in Education and information technologies 27.6.2024: 1-24
Online Ressource
Artikel 95 Reflections on Simplicity and Complexity in Computational Neuroscience
Enthalten in Human arenas 21.6.2024: 1-9
Online Ressource
Artikel 96 Unraveling the complexity of vascular tone regulation: a multiscale computational approach to integrating chemo-mechano-biological pathways with cardiovascular biomechanics
Enthalten in Biomechanics and modeling in mechanobiology 20.3.2024: 1-30
Online Ressource
Artikel 97 A power-efficient approximate approach to improve the computational complexity of coding tools in versatile video coding
Enthalten in Multimedia tools and applications 6.2.2024: 1-17
Online Ressource
Online Ressourcen 98 A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph
Kunisky, Dmitriy. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource
Online Ressourcen 99 A Distribution Testing Oracle Separating QMA and QCMA
Natarajan, Anand. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource
Online Ressourcen 100 A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs
d'Orsi, Tommaso. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Online Ressource


91 - 100 von 655
<< < > >>


E-Mail-IconAdministration