Evaluation of circuits over nilpotent and polycyclic groups (Q1750355): 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.1007/s00453-017-0343-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2725306094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primality and identity testing via Chinese remaindering / 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: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Philip Hall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite monoids and the fine structure of <i>NC</i> <sup>1</sup> / 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: Computing Algebraic Formulas Using a Constant Number of Registers / 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: Formal Theories for Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy in Baumslag's group, generic case complexity, and division in power circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Fast Parallel Polynomial Arithmetic / 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: Q3944763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / 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: On certain classes of infinite solvable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Commutator Subgroup of a Group Generated by Two Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting nonlinear cellular automata quickly by decomposing them into linear ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: TC^0 circuits for algorithmic problems in nilpotent groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset sum problem in polycyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / 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: Free subgroups in linear groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of membership problems for circuits over sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parallel complexity of linear groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite central height in linear groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3849050 / rank
 
Normal rank

Latest revision as of 15:34, 15 July 2024

scientific article
Language Label Description Also known as
English
Evaluation of circuits over nilpotent and polycyclic groups
scientific article

    Statements

    Evaluation of circuits over nilpotent and polycyclic groups (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers