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

821 - 830 von 867
<< < > >>


Artikel 821 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 822 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 823 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 824 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 825 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 826 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 827 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 828 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 829 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 830 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


821 - 830 von 867
<< < > >>


E-Mail-IconAdministration