"Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision ..."

Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr. (1997)

> Home

Details and statistics

DOI: 10.1007/BF02770873

access: open

type: Journal Article

metadata version: 2021-02-22

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dcg/GrigorievKV97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/GrigorievKV97
Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees. Discret. Comput. Geom. 17(2): 191-215 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.