Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194): 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.1007/s00037-013-0072-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094903317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Algebraic Formulas Using a Constant Number of Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for read-\(k\)-times branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and reduction in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic \(NC^1\) computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant's algebraic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size Boolean formulas compute exactly those functions in AC\(^ 0\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity / 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: Q4385525 / 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: Arithmetizing Classes Around NC 1 and L / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on arithmetic circuits via partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-linear formulas for permanent and determinant are of super-polynomial size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing syntactically multilinear arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929052 / 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: Q4393484 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:51, 6 July 2024

scientific article
Language Label Description Also known as
English
Resource trade-offs in syntactically multilinear arithmetic circuits
scientific article

    Statements

    Resource trade-offs in syntactically multilinear arithmetic circuits (English)
    0 references
    0 references
    0 references
    0 references
    30 September 2013
    0 references
    arithmetic circuits
    0 references
    Valiant's classes
    0 references
    syntactic multilinearity
    0 references
    circuit width
    0 references
    algebraic branching programs
    0 references

    Identifiers