On the descriptive complexity of groups without abelian normal subgroups (Q6858433)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

On the descriptive complexity of groups without abelian normal subgroups

scientific article; zbMATH DE number 8159452

Language	Label	Description	Also known as
default for all languages	No label defined
English	On the descriptive complexity of groups without abelian normal subgroups	scientific article; zbMATH DE number 8159452

Statements

instance of

scholarly article

0 references

title

On the descriptive complexity of groups without abelian normal subgroups (English)

0 references

0 references

0 references

Logical Methods in Computer Science

0 references

publication date

13 February 2026

0 references

copyright license

Creative Commons Attribution 4.0 International

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Reachability is harder for directed than for undirected finite graphs

0 references

On winning strategies in Ehrenfeucht-Fraïssé games

0 references

Graph Isomorphism is in SPP

0 references

Proceedings of the forty-eighth annual ACM symposium on Theory of Computing

0 references

Q4240509

0 references

Polynomial-time theory of matrix groups

0 references

Q5365126

0 references

Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups

0 references

Construction of finite groups

0 references

A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS

0 references

Q4256650

0 references

A fast isomorphism test for groups whose Lie algebra has genus 2

0 references

Polynomial-time isomorphism test for groups with abelian Sylow towers.

0 references

Combinatorial approaches to the group isomorphism problem

0 references

On the Weisfeiler-Leman dimension of finite groups

0 references

A systematic study of isomorphism invariants of finite groups via the Weisfeiler-Leman dimension

0 references

An optimal lower bound on the number of variables for graph identification

0 references

Automorphism group computation and isomorphism testing in finite groups

0 references

Count-free Weisfeiler-Leman and group isomorphism

0 references

On multidimensional Schur rings of finite groups

0 references

Graph isomorphism is not $\mathsf{AC}^{0}$-reducible to group isomorphism

0 references

Pebble games with algebraic rules

0 references

Nearly linear time isomorphism algorithms for some nonabelian group classes

0 references

Generalizations of $k$-dimensional Weisfeiler-Leman stabilization

0 references

Group isomorphism is nearly-linear time for most orders

0 references

An application of games to the completeness problem for formalized theories

0 references

CONSTRUCTING AUTOMORPHISM GROUPS OF <i>p</i>-GROUPS

0 references

On fixed-point logic with counting

0 references

Q3230355

0 references

Q5091279

0 references

On the descriptive complexity of groups without abelian normal subgroups (extended abstract)

0 references

On the parallel complexity of group isomorphism via Weisfeiler-Leman

0 references

Canonisation and Definability for Graphs of Bounded Rank Width

0 references

PEBBLE GAMES AND LINEAR EQUATIONS

0 references

Descriptive complexity of finite abelian groups

0 references

Polynomial-time isomorphism test of groups that are tame extensions (extended abstract)

0 references

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

0 references

The logic of graph neural networks

0 references

Testing Graph Isomorphism in Parallel by Playing a Game

0 references

Definability hierarchies of generalized quantifiers

0 references

Logical hierarchies in PTIME

0 references

The occurrence of finite groups in the automorphism group of nilpotent groups of class 2

0 references

On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions

0 references

Relational queries computable in polynomial time

0 references

Which problems have strongly exponential complexity?

0 references

Algorithms based on $*$-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing

0 references

Finite group theory.

0 references

Linear time algorithms for Abelian group isomorphism and related problems

0 references

The iteration number of colour refinement

0 references

Factoring Groups Efficiently

0 references

The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3

0 references

Graphs Identified by Logics with Counting

0 references

Graph isomorphism is low for PP

0 references

On the Structure of Polynomial Time Reducibility

0 references

Efficient isomorphism testing for a class of group extensions

0 references

Q3113046

0 references

Isomorphism in expanding families of indistinguishable groups.

0 references

Stability of nilpotent groups of class 2 and prime exponent

0 references

On the $n\log{n}$ isomorphism technique (preliminary report)

0 references

On a generalization of quantifiers

0 references

Describing finite groups by short first-order sentences

0 references

On isomorphism testing of groups with normal Hall subgroups

0 references

Ehrenfeucht-Fraïssé Games on Random Structures

0 references

Graph isomorphism is in the low hierarchy

0 references

An $O(n)$ algorithm for Abelian $p$-group isomorphism and an $O(n \log n)$ algorithm for Abelian group isomorphism

0 references

Existence, algorithms, and asymptotics of direct product decompositions. I.

0 references

The threshold for subgroup profiles to agree is $\Omega(\log n)$

0 references

Graph isomorphism problem

0 references

Identifiers

DOI

10.46298/LMCS-21(4:20)2025

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi On the descriptive complexity of groups without abelian normal subgroups