Evaluation of circuits over nilpotent and polycyclic groups
type: Item
instance of: scholarly article
title: Evaluation of circuits over nilpotent and polycyclic groups
zbMATH Open document ID: 1390.68311
author: D. König
author: Markus Lohrey
published in: Algorithmica
publication date: 2018-05-18T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6870377
MaRDI profile type: Publication
full work available at URL: s00453-017-0343-z
OpenAlex ID: W2725306094
cites work: Primality and identity testing via Chinese remaindering
cites work: The complexity of matrix rank and feasible systems of linear equations
cites work: On the Complexity of Numerical Analysis
cites work: Non-commutative arithmetic circuits: depth reduction and size lower bounds
cites work: A very hard log-space counting class
cites work: Computational Complexity
cites work: On a problem of Philip Hall
cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
cites work: Finite monoids and the fine structure of NC 1
cites work: Finite Monoids: From Word to Circuit Evaluation
cites work: Computing Algebraic Formulas Using a Constant Number of Registers
cites work: A presentation for the unipotent group over rings with identity
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Formal theories for linear algebra
cites work: Conjugacy in Baumslag's group, generic case complexity, and division in power circuits
cites work: Very Fast Parallel Polynomial Arithmetic
cites work: Uniform constant-depth threshold circuits for division and iterated multiplication.
cites work: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
cites work: Q4526985
cites work: Derandomizing polynomial identity tests means proving circuit lower bounds
cites work: Q3342725
cites work: Q3944763
cites work: Q4349924
cites work: Parallel Identity Testing for Skew Circuits with Big Powers and Applications
cites work: Word Problems Solvable in Logspace
cites work: Word Problems and Membership Problems on Compressed Words
cites work: Algorithmics on SLP-compressed strings: a survey
cites work: The Compressed Word Problem for Groups
cites work: Rational subsets of unitriangular groups
cites work: On certain classes of infinite solvable groups
cites work: The Commutator Subgroup of a Group Generated by Two Operators
cites work: Predicting nonlinear cellular automata quickly by decomposing them into linear ones
cites work: TC^0 circuits for algorithmic problems in nilpotent groups
cites work: Subset sum problem in polycyclic groups
cites work: Q4317890
cites work: On uniform circuit complexity
cites work: Q3048248
cites work: Shorter Notes: Representations of Polycyclic Groups
cites work: Free subgroups in linear groups
cites work: The complexity of membership problems for circuits over sets of integers
cites work: Q4393484
cites work: On the parallel complexity of linear groups
cites work: Finite central height in linear groups
cites work: Q3849050
DOI: 10.1007/S00453-017-0343-Z
description: scientific article; zbMATH DE number 6870377