Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021)

From MaRDI portal
Revision as of 00:10, 4 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    23 March 1997
    0 references
    0 references
    algebraic decision
    0 references
    computation trees
    0 references
    convex polyhedra
    0 references