Parallel complexity of identifying groups and quasigroups via decompositions

Cites work

A systematic study of isomorphism invariants of finite groups via the Weisfeiler-Leman dimension
Algorithms for group isomorphism via group extensions and cohomology
An optimal lower bound on the number of variables for graph identification
Canonical labeling of Latin squares in average-case polynomial time
Canonizing graphs of bounded rank-width in parallel via Weisfeiler-Leman
Central and medial quasigroups of small order
Count-free Weisfeiler-Leman and group isomorphism
Definability hierarchies of generalized quantifiers
Elements of finite model theory.
Existence, algorithms, and asymptotics of direct product decompositions. I.
Factoring Groups Efficiently
Finite modules over \(\mathbb Z[t,t^{-1}]\).
Finite nets. II: Uniqueness and imbedding
Graph Isomorphism is in SPP
Graph isomorphism is in the low hierarchy
Graph isomorphism is low for PP
Graph isomorphism is not \(\mathsf{AC}^{0}\)-reducible to group isomorphism
Graph isomorphism problem
Group isotopes and a holomorphic action.
scientific article; zbMATH DE number 3836338 (Why is no real title available?)
scientific article; zbMATH DE number 3966480 (Why is no real title available?)
scientific article; zbMATH DE number 3758564 (Why is no real title available?)
scientific article; zbMATH DE number 1263431 (Why is no real title available?)
scientific article; zbMATH DE number 1318518 (Why is no real title available?)
scientific article; zbMATH DE number 612169 (Why is no real title available?)
scientific article; zbMATH DE number 1164014 (Why is no real title available?)
scientific article; zbMATH DE number 1511246 (Why is no real title available?)
scientific article; zbMATH DE number 3303153 (Why is no real title available?)
scientific article; zbMATH DE number 3401193 (Why is no real title available?)
scientific article; zbMATH DE number 3401194 (Why is no real title available?)
scientific article; zbMATH DE number 4188100 (Why is no real title available?)
Linear algebraic analogues of the graph isomorphism problem and the Erdős-Rényi model
Linear time algorithms for Abelian group isomorphism and related problems
Logical hierarchies in PTIME
Mal'cev varieties
Medial and semimedial left quasigroups
On axioms of linear functions
On isomorphism testing of groups with normal Hall subgroups
On the \(n\log{n}\) isomorphism technique (preliminary report)
On the complexity of some problems on groups input as multiplication tables
On the constant-depth circuit complexity of generating quasigroups
On the descriptive complexity of groups without abelian normal subgroups
On the parallel complexity of group isomorphism via Weisfeiler-Leman
On the Weisfeiler-Leman dimension of finite groups
Parity, circuits, and the polynomial-time hierarchy
Polynomial-time isomorphism test for groups with abelian Sylow towers.
Quasigroups. I
Small-diameter Cayley graphs for finite simple groups
Structure of Abelian Quasi-Groups
Testing Graph Isomorphism in Parallel by Playing a Game
Which problems have strongly exponential complexity?

This page was built for publication: Parallel complexity of identifying groups and quasigroups via decompositions

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