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

841 - 850 von 889
<< < > >>


Artikel 841 Human Purkinje cells outperform mouse Purkinje cells in dendritic complexity and computational capacity
Enthalten in Communications biology Bd. 7, 2.1.2024, Nr. 1, date:12.2024: 1-18
Online Ressource
Artikel 842 Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
Enthalten in Journal of automated reasoning Bd. 63, 31.7.2019, Nr. 4, date:12.2019: 813-855
Online Ressource
Artikel 843 Language policy and planning: a discussion on the complexity of language matters and the role of computational methods
Enthalten in SN social sciences Bd. 1, 2.8.2021, Nr. 8, date:8.2021: 1-22
Online Ressource
Artikel 844 Low computational complexity methods for decoding of STBC in the uplink of a massive MIMO system
Enthalten in European Association for Speech, Signal and Image Processing: EURASIP journal on wireless communications and networking Bd. 2020, 3.6.2020, Nr. 1, date:12.2020: 1-17
Online Ressource
Artikel 845 Low Computational Complexity Precoding Selection for 5G New Radio
Enthalten in Wireless personal communications Bd. 138, 1.10.2024, Nr. 3, date:10.2024: 2031-2052
Online Ressource
Artikel 846 Managing computational complexity using surrogate models: a critical review
Enthalten in Research in engineering design Bd. 31, 6.4.2020, Nr. 3, date:7.2020: 275-298
Online Ressource
Artikel 847 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 848 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
Bücher 849 On the complexity of some basic problems in computational convexity
Gritzmann, Peter. - Trier : Univ., Mathematik/Informatik
Artikel 850 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


841 - 850 von 889
<< < > >>


E-Mail-IconAdministration