A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials (Q4907594)

From MaRDI portal
Revision as of 09:16, 11 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 6134393
Language Label Description Also known as
English
A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
scientific article; zbMATH DE number 6134393

    Statements

    A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials (English)
    0 references
    0 references
    0 references
    4 February 2013
    0 references
    complexity classes
    0 references
    lower bounds for complexity
    0 references
    arithmetic circuits
    0 references
    thin sets
    0 references
    monotone complexity
    0 references
    permanent
    0 references

    Identifiers