Location of Repository

On the polyhedral decision problem

By Andrew C. Yao, Ronald and L. Rivest


Abstract. Computational problems sometimes can be cast in the following form: Given a point x in R, determine if x lies in some fixed polyhedron. In this paper we give a general lower bound to the complexity of such problems, showing that 1/2 log2 fs linear comparisons are needed in the worst case, for any polyhedron with fs s-dimensional faces. For polyhedra with abundant faces, this leads to lower bounds nonlinear in n, the number of variables

Topics: Key words, adversary strategy, complexity, dimension, edge, face, linear decision tree
Year: 1977
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://people.csail.mit.edu/ri... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.