Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02770873 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045871238 / rank | |||
Normal rank | |||
Latest revision as of 10:14, 30 July 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
0 references
