Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bound on testing membership to a polyhedron by algebraic decision and computation trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bound on testing membership to a polyhedron by algebraic decision and computation trees |
scientific article |
Statements
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (English)
0 references
23 March 1997
0 references
algebraic decision
0 references
computation trees
0 references
convex polyhedra
0 references
0 references
