Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:25, 30 January 2024
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
