- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Electronic Journal of Probability 29: 72 (2024-05-08)
- Ereignis
-
Veröffentlichung
- (wo)
-
Hamburg
- (wer)
-
Technische Universität Hamburg. Universitätsbibliothek
- (wann)
-
2024
- Urheber
- DOI
-
10.15480/882.13291
- URN
-
urn:nbn:de:101:1-2409180309132.597987848628
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:50 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.
Beteiligte
- Schulte, Matthias
- Trapp, Vanessa
- Technische Universität Hamburg. Universitätsbibliothek
Entstanden
- 2024
Ähnliche Objekte (12)
Upper and lower bounds for some shape functionals
Concentration Inequalities for poisson functionals
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
Inferring Lower Bounds for Runtime Complexity
Lower bounds for Auslander's representation dimension
Lower Bounds for Possibly Divergent Probabilistic Programs
Lower bounds for hit-and-run optimization
On lower bounds for parity branching programs
Upper and lower bounds for some shape functionals
Concentration Inequalities for poisson functionals
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
Inferring Lower Bounds for Runtime Complexity
Lower bounds for Auslander's representation dimension
Lower Bounds for Possibly Divergent Probabilistic Programs
Lower bounds for hit-and-run optimization
On lower bounds for parity branching programs
Upper and lower bounds for some shape functionals
Concentration Inequalities for poisson functionals
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
Inferring Lower Bounds for Runtime Complexity
Lower bounds for Auslander's representation dimension
Lower Bounds for Possibly Divergent Probabilistic Programs
Lower bounds for hit-and-run optimization