Evaluating Matrix Circuits (Q3196387): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Daniel König / rank
Normal rank
 
Property / author
 
Property / author: Daniel König / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962914768 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.03540 / 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: On the Complexity of Numerical Analysis / 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: A very hard log-space counting class / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Philip Hall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Monoids: From Word to Circuit Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A presentation for the unipotent group over rings with identity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / 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: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / 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: Q3342725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Matrix Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Identity Testing for Skew Circuits with Big Powers and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems Solvable in Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems and Membership Problems on Compressed Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics on SLP-compressed strings: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Compressed Word Problem for Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational subsets of unitriangular groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Notes: Representations of Polycyclic Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite central height in linear groups / rank
 
Normal rank

Latest revision as of 23:17, 10 July 2024

scientific article
Language Label Description Also known as
English
Evaluating Matrix Circuits
scientific article

    Statements

    Evaluating Matrix Circuits (English)
    0 references
    0 references
    0 references
    29 October 2015
    0 references

    Identifiers