- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Electronic Journal of Probability 29: 72 (2024-05-08)
- Event
-
Veröffentlichung
- (where)
-
Hamburg
- (who)
-
Technische Universität Hamburg. Universitätsbibliothek
- (when)
-
2024
- Creator
- DOI
-
10.15480/882.13291
- URN
-
urn:nbn:de:101:1-2409180309132.597987848628
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:50 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Schulte, Matthias
- Trapp, Vanessa
- Technische Universität Hamburg. Universitätsbibliothek
Time of origin
- 2024
Other Objects (12)
Upper and lower bounds for some shape functionals
Concentration Inequalities for poisson functionals
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Lower bounds for Auslander's representation dimension
Inferring Lower Bounds for Runtime Complexity
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
On lower bounds for parity branching programs
Lower bounds for the strict invariance entropy
Lower bounds for hit-and-run optimization
Upper and lower bounds for some shape functionals
Concentration Inequalities for poisson functionals
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Lower bounds for Auslander's representation dimension
Inferring Lower Bounds for Runtime Complexity
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
On lower bounds for parity branching programs
Lower bounds for the strict invariance entropy
Lower bounds for hit-and-run optimization
Upper and lower bounds for some shape functionals
Concentration Inequalities for poisson functionals
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Lower bounds for Auslander's representation dimension
Inferring Lower Bounds for Runtime Complexity
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
On lower bounds for parity branching programs
Lower bounds for the strict invariance entropy