Lower bounds on arithmetic circuits via partial derivatives (Q1377574): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Certain Class of Incidence Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the depth complexity of formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct version of Shamir and Snir's lower bounds on monotone circuit depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation can be exponentially powerful / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01294256 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171403864 / rank
 
Normal rank

Latest revision as of 08:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds on arithmetic circuits via partial derivatives
scientific article

    Statements

    Lower bounds on arithmetic circuits via partial derivatives (English)
    0 references
    0 references
    0 references
    11 June 1998
    0 references
    circuit complexity
    0 references
    arithmetic circuits
    0 references
    complexity measure for multivariate polynomials
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references