Abstract
In this chapter we are going to prove that E m,n (S) and also E m,n (s) are polynomial in m and n. The proof is highly technical and must be done very carefully. So I will explain it in detail and I will try to illustrate our considerations as well as possible.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Borgwardt, K.H. (1987). The Polynomiality of the Expected Number of Steps. In: The Simplex Method. Algorithms and Combinatorics, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61578-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-61578-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17096-9
Online ISBN: 978-3-642-61578-8
eBook Packages: Springer Book Archive