The parallel dynamic complexity of the abelian Cayley group membership problem

Cites work

\(\Sigma_ 1^ 1\)-formulae on finite structures
A strategy for dynamic programs: start over and muddle through
Circuit Definitions of Nondeterministic Complexity Classes
Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes
Dyn-FO: A parallel, dynamic complexity class
Faster isomorphism for p-groups of class 2 and exponent p
Graph isomorphism is not \(\mathsf{AC}^{0}\)-reducible to group isomorphism
scientific article; zbMATH DE number 1254648 (Why is no real title available?)
scientific article; zbMATH DE number 1332669 (Why is no real title available?)
scientific article; zbMATH DE number 549850 (Why is no real title available?)
scientific article; zbMATH DE number 1849958 (Why is no real title available?)
Linear time algorithms for Abelian group isomorphism and related problems
Nonrecursive incremental evaluation of Datalog queries
On Deriving the Inverse of a Sum of Matrices
On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors
On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
On the complexity of some problems on groups input as multiplication tables
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Reachability and distances under multiple changes
Reachability is in DynFO
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
Spot-checkers
The Parallel Complexity of Abelian Permutation Group Problems
Undirected connectivity in log-space
Uniform constant-depth threshold circuits for division and iterated multiplication.

This page was built for publication: The parallel dynamic complexity of the abelian Cayley group membership problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263559)