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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Dima Yu. Grigoriev / rank
 
Normal rank
Property / author
 
Property / author: Nikolaj N. jun. Vorob'ev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Decision Trees, Subspace Arrangements, and Mobius Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of deciding Tarski algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on testing membership to a polyhedron by algebraic decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting connected components of a semialgebraic set in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity lower bounds for computation trees with elementary transcendental function gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5621733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Betti Numbers of Real Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for arithmetic networks. II: Sum of Betti numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding irreducible components of some real transcendental varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision tree complexity and Betti numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Polyhedral Decision Problem / rank
 
Normal rank
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 11: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
    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
    0 references