Computability of the additive complexity of algebraic circuits with root extracting (Q1351701): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Additive complexity in directed computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds in algebraic computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of quantifier elimination in the theory of ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Sparse Rational Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135191 / 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: VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of algebraic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Complexity and Zeros of Real Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Liouville's theory of elementary functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Structure Theorem for Exponential and Primitive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the additive complexity of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3255438 / rank
 
Normal rank

Latest revision as of 10:11, 27 May 2024

scientific article
Language Label Description Also known as
English
Computability of the additive complexity of algebraic circuits with root extracting
scientific article

    Statements

    Identifiers