Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Dima Grigoriev, Marek Karpinski, Nicolai Vorobjov. Lower bounds on testing membership to a polyhedron by algebraic decision trees. In STOC. pages 635-644, 1994. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation TreesDima Grigoriev, Marek Karpinski, Nicolai Vorobjov. dcg, 17(2):191-215, 1997. [doi] Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision TreesDima Grigoriev, Marek Karpinski, Nicolai Vorobjov. focs 1995: 258-265
The following publications are possibly variants of this publication: