Monomials, multilinearity and identity testing in simple read-restricted circuits (Q2637354): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.2014.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140443719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jacobian hits circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of matrix rank and feasible systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships among $PL$, $\#L$, and the determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orbit problem is in the GapL hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Parallel Algorithm for Formula Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems complete for deterministic logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform constant-depth threshold circuits for division and iterated multiplication. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing polynomial identity tests means proving circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two problems on arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumerating monomials and other combinatorial structures by polynomial interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank

Latest revision as of 07:58, 7 July 2024

scientific article
Language Label Description Also known as
English
Monomials, multilinearity and identity testing in simple read-restricted circuits
scientific article

    Statements

    Monomials, multilinearity and identity testing in simple read-restricted circuits (English)
    0 references
    0 references
    0 references
    0 references
    11 February 2014
    0 references
    arithmetic circuits
    0 references
    computational complexity
    0 references

    Identifiers