Skip to main content
SpringerLink
Log in

New lower bound for polyhedral membership problem with an application to linear programming

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 176))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.C. Yao, R.L. Rivest, On the polyhedral decision problem. Siam J. Comput., Vol. 9, No. 2, May 1980.

    Google Scholar 

  2. J. Morávek, A localization problem in geometry and complexity of discrete programming. Kybernetika (Prague) 8: 498–516 (1972).

    Google Scholar 

  3. J. Morávek, On the complexity of discrete programming problems. Aplikace matematiky 14: 442–474 (1969).

    Google Scholar 

  4. J. Morávek, A note upon minimal path problem. Journal of Math. Analysis and Appl. 30: 702–717 (1970).

    Google Scholar 

  5. J. Morávek, A geometrical method in combinatorial complexity. Aplikace matematiky 26: 82–96 (1981).

    Google Scholar 

  6. J. Morávek, Decision trees and lower bound for complexity of linear programming, in Graphs and Other Combinatorial Topics. M. Fiedler, Ed., Proc. of the Third Czechoslovak Symposium on Graph Theory, held in Prague, 1982.

    Google Scholar 

  7. E. Kalinová, The localization problem in geometry and Rabin-Spira linear proofs. (Czech), M.Sci. thesis, Universitas Carolina, Prague, 1978.

    Google Scholar 

  8. E. Györi, An n-dimensional search problemwith restricted questions. Combinatorica 1(4) (1981) 377–380.

    Google Scholar 

  9. B. Grünbaum, Convex Polytopes. John Wiley, 1967.

    Google Scholar 

  10. D. Avis, Comments on a lower bound for convex hull determination: "On the Ω (n log n) lower bound for convex hull and maximal vector determination" by van Emde Boas. Inform. Process. Lett. 11 (1980), No. 3, 126.

    Google Scholar 

  11. J.W. Jaromczyk, Linear decision trees are too weak for convex hull problem. Infor. Process. Lett. 12 (1981), No. 3, 138–141.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, Czechoslovak Academy of Sciences, 115 67, Praha 1, Czechoslovakia

    Jaroslav Morávek & Pavel Pudlák

Authors
  1. Jaroslav Morávek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavel Pudlák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morávek, J., Pudlák, P. (1984). New lower bound for polyhedral membership problem with an application to linear programming. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030324

Download citation

  • DOI: https://doi.org/10.1007/BFb0030324

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation