Skip to main content
SpringerLink
Log in

Lower bounds for problems defined by polynomial inequalities

  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 1981)

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

Included in the following conference series:

Abstract

We have offered the method to study the lower bounds in a reasonable wide class of decision trees.

On the other hand we have shown that for certain problems wider classes decision trees are sometimes profitless. We believe that demonstrated approach can be helpful while considering problems in Computational Geometry.

At the end it is worth noticing that a case in which all the polynomials of the description are linear seems to be of the special interest.

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. Avis, D., Comments on a lower bound for convex hull determination. Inf. Proc. Let., 11 (1980), 126.

    Google Scholar 

  2. Jaromczyk, J., W., Linear decision trees are too weak for convex hull problem. to appear in Inf. Proc. Let.

    Google Scholar 

  3. Jaromczyk, J., W., A note on Rabin's complete proof notion (preliminary version). IInf UW Reports, 102 (1981).

    Google Scholar 

  4. Jaromczyk, J., W., to appear.

    Google Scholar 

  5. Kendig, K., Elementary Algebraic Geometry. Springer Verlag, New York, 1977.

    Google Scholar 

  6. Rabin, M., O., Proving simultaneous positivity of linear forms. J. Comp. Sys. Sci., 6 (1972), 639–650.

    Google Scholar 

  7. Snir, M., communicated to me by Peter van Emde Boas.

    Google Scholar 

  8. Spira, P., M., Complete linear proofs of systems of linear inequalities. J. Comp. Sys. Sci., 6 (1972), 205–216.

    Google Scholar 

  9. van der Waerden, B. L., Einführung in die algebraische Geometrie. Springer Verlag, Berlin, 1973.

    Google Scholar 

  10. Yao, A., C., A lower bound to finding convex hulls. Report STAN-CS-79-733, April 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, PKiN VIII p., 00-901, Warsaw, Poland

    Jerzy W. Jaromczyk

Authors
  1. Jerzy W. Jaromczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jaromczyk, J.W. (1981). Lower bounds for problems defined by polynomial inequalities. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation