Arithmetic circuits: the chasm at depth four gets wider (Q442109): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016576580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-commutative arithmetic circuits: depth reduction and size lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On arithmetic branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Syntactically Multilinear Algebraic Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing a fraction of two determinants as a determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant's algebraic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing syntactically multilinear arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and separations for constant depth multilinear circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Lower Bounds for Satisfiability and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties that characterize LOGCFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Small-Depth Computation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 12:41, 5 July 2024

scientific article
Language Label Description Also known as
English
Arithmetic circuits: the chasm at depth four gets wider
scientific article

    Statements

    Arithmetic circuits: the chasm at depth four gets wider (English)
    0 references
    0 references
    9 August 2012
    0 references
    arithmetic circuits
    0 references
    depth reduction
    0 references
    lower bounds
    0 references
    identity testing
    0 references

    Identifiers