- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Mathematical Proceedings of the Cambridge Philosophical Society 150.1 (2011): S. 23-33. 09.11.2012
- Klassifikation
-
Mathematik
- Schlagwort
-
-
- Ereignis
-
Veröffentlichung
- (wo)
-
Erlangen
- (wer)
-
Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
- (wann)
-
2012
- Urheber
-
Lange, Herbert
Newstead, Peter E.
- URN
-
urn:nbn:de:bvb:29-opus-38662
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:03 MESZ
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
- Lange, Herbert
- Newstead, Peter E.
- Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
Entstanden
- 2012
Ähnliche Objekte (12)
Lower bounds for the low-rank matrix approximation
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Comparison of guaranteed lower eigenvalue bounds with three skeletal schemes
Proportionality’s Lower Bound
Higher rank Clifford indices of curves on a K3 surface
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Treewidth Lower Bounds with Brambles
Lower Bounds for Heuristic Algorithms
Bounds for theta sums in higher rank. II
Lower bounds for the low-rank matrix approximation
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Comparison of guaranteed lower eigenvalue bounds with three skeletal schemes
Proportionality’s Lower Bound
Higher rank Clifford indices of curves on a K3 surface
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Treewidth Lower Bounds with Brambles
Lower Bounds for Heuristic Algorithms
Bounds for theta sums in higher rank. II
Lower bounds for the low-rank matrix approximation
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Comparison of guaranteed lower eigenvalue bounds with three skeletal schemes
Proportionality’s Lower Bound
Higher rank Clifford indices of curves on a K3 surface
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Treewidth Lower Bounds with Brambles
Lower Bounds for Heuristic Algorithms