- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Mathematical Programming: Series A, Series B ; A Publication of the Mathematical Programming Society, 199, (1-2), Springer, ISSN 0025-5610
- Event
-
Veröffentlichung
- (where)
-
Darmstadt
- (who)
-
Universitäts- und Landesbibliothek
- (when)
-
2025
- Creator
- DOI
-
10.26083/tuprints-00028505
- URN
-
urn:nbn:de:tuda-tuprints-285052
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:26 AM CEST
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
- Disser, Yann
- Friedmann, Oliver
- Hopp, Alexander Vincent
- Universitäts- und Landesbibliothek
Time of origin
- 2025
Other Objects (12)
An exponential lower bound for Zadeh’s pivot rule
On Friedmann's subexponential lower bound for Zadeh's pivot rule
On Friedmann's subexponential lower bound for Zadeh's pivot rule
Exponential Lower Bound for Berge-Ramsey Problems
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
Exponential lower bounds for solving infinitary payoff games and linear programs
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
The complexity of Zadeh's pivot rule
The Complexity of Zadeh's Pivot Rule
Exponential Resolution Lower Bounds for the Weak Pigeonhole Principle over Sparse Graphs
Exponential lower bounds of lattice counts by vertical sum and 2-sum
Counter-cyclical fiscal rules and the zero lower bound
An exponential lower bound for Zadeh’s pivot rule
On Friedmann's subexponential lower bound for Zadeh's pivot rule
On Friedmann's subexponential lower bound for Zadeh's pivot rule
Exponential Lower Bound for Berge-Ramsey Problems
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
Exponential lower bounds for solving infinitary payoff games and linear programs
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
The complexity of Zadeh's pivot rule
The Complexity of Zadeh's Pivot Rule
Exponential Resolution Lower Bounds for the Weak Pigeonhole Principle over Sparse Graphs
Exponential lower bounds of lattice counts by vertical sum and 2-sum
Counter-cyclical fiscal rules and the zero lower bound
An exponential lower bound for Zadeh’s pivot rule
On Friedmann's subexponential lower bound for Zadeh's pivot rule
On Friedmann's subexponential lower bound for Zadeh's pivot rule
Exponential Lower Bound for Berge-Ramsey Problems
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
Exponential lower bounds for solving infinitary payoff games and linear programs
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
The complexity of Zadeh's pivot rule
The Complexity of Zadeh's Pivot Rule
Exponential Resolution Lower Bounds for the Weak Pigeonhole Principle over Sparse Graphs
Exponential lower bounds of lattice counts by vertical sum and 2-sum