Hochschulschrift
Highly Accurate Random Phase Approximation Methods With Linear Time Complexity
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
München, Ludwig-Maximilians-Universität, Dissertation, 2017
- Klassifikation
-
Chemie
- Ereignis
-
Veröffentlichung
- (wo)
-
München
- (wer)
-
Universitätsbibliothek der Ludwig-Maximilians-Universität
- (wann)
-
2017
- Urheber
-
Schurkus, Henry F.
- Beteiligte Personen und Organisationen
-
Ochsenfeld, Christian
- URN
-
urn:nbn:de:bvb:19-210592
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:46 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Schurkus, Henry F.
- Ochsenfeld, Christian
- Universitätsbibliothek der Ludwig-Maximilians-Universität
Entstanden
- 2017
Ähnliche Objekte (12)
Adaptive estimation in regression and complexity af approximation of random fields
Complexity and approximation, Buch.
Approximation complexity of optimization problems
Approximation complexity of optimization problems
Continuous approximation of a random walk
Topological complexity of smooth random functions
Highly accurate mobile robot navigation
Highly Accurate, But Still Discriminatory
Highly Accurate, But Still Discriminatory
Stochastic approximation and optimization of random systems
Pathwise Approximation of Random Ordinary Differential Equations
The process complexity and effective random tests
Adaptive estimation in regression and complexity af approximation of random fields
Complexity and approximation, Buch.
Approximation complexity of optimization problems
Approximation complexity of optimization problems
Continuous approximation of a random walk
Topological complexity of smooth random functions
Highly accurate mobile robot navigation
Highly Accurate, But Still Discriminatory
Highly Accurate, But Still Discriminatory
Stochastic approximation and optimization of random systems
Pathwise Approximation of Random Ordinary Differential Equations
The process complexity and effective random tests
Adaptive estimation in regression and complexity af approximation of random fields
Complexity and approximation, Buch.
Approximation complexity of optimization problems
Approximation complexity of optimization problems
Continuous approximation of a random walk
Topological complexity of smooth random functions
Highly accurate mobile robot navigation
Highly Accurate, But Still Discriminatory
Highly Accurate, But Still Discriminatory
Stochastic approximation and optimization of random systems
Pathwise Approximation of Random Ordinary Differential Equations