- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Mathematical Proceedings of the Cambridge Philosophical Society 150.1 (2011): S. 23-33. 09.11.2012
- Classification
-
Mathematik
- Keyword
-
-
- Event
-
Veröffentlichung
- (where)
-
Erlangen
- (who)
-
Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
- (when)
-
2012
- Creator
-
Lange, Herbert
Newstead, Peter E.
- URN
-
urn:nbn:de:bvb:29-opus-38662
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:41 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
- Lange, Herbert
- Newstead, Peter E.
- Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
Time of origin
- 2012
Other Objects (12)
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Resolution Lower Bounds for Refutation Statements
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity
Zero Lower Bound on Inflation Expectations
Inequality and the Zero Lower Bound
Lower bounds for Auslander's representation dimension
Why are Proof Complexity Lower Bounds Hard?
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Resolution Lower Bounds for Refutation Statements
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity
Zero Lower Bound on Inflation Expectations
Inequality and the Zero Lower Bound
Lower bounds for Auslander's representation dimension
Why are Proof Complexity Lower Bounds Hard?
Guaranteed lower bounds for eigenvalues
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Resolution Lower Bounds for Refutation Statements
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity
Zero Lower Bound on Inflation Expectations
Inequality and the Zero Lower Bound
Lower bounds for Auslander's representation dimension