Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/tcs/GrigorievV96, #quickstatements; #temporary_batch_1731543907597
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q198260 / rank
Normal rank
 
Property / author
 
Property / author: Nikolaj N. jun. Vorob'ev / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q30048515 / rank
 
Normal rank
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: Semianalytic and subanalytic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3719722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complements of subanalytic sets and existential formulas for analytic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of stratifications of semi-Pfaffian sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of deciding Tarski algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4308393 / 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: On Computing Algebraic Functions Using Logarithms and Exponentials / 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: Complexity lower bounds for computation trees with elementary transcendental function gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Properties of Subanalytic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la complexité du principe de Tarski-Seidenberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001976 / 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: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination / 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: Real-Analytic Desingularization and Subanalytic Sets: An Elementary Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of deciding consistency of systems of polynomials in exponent inequalities / 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 / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/GrigorievV96 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:34, 14 November 2024

scientific article
Language Label Description Also known as
English
Complexity lower bounds for computation trees with elementary transcendental function gates
scientific article

    Statements

    Complexity lower bounds for computation trees with elementary transcendental function gates (English)
    0 references
    9 September 1997
    0 references
    computation trees
    0 references

    Identifiers