scientific article; zbMATH DE number 3722702

Cited in

(28)

Graph isomorphism problem
Parallel algorithms for solvable permutation groups
Isomorphism of graphs of bounded valence can be tested in polynomial time
The isomorphism problem for classes of graphs closed under contraction
Efficient representation of perm groups
Polynomial time recognition and testing of isomorphism of cyclic tournaments
Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments
Graph isomorphism is low for PP
Algorithms for matrix groups and the Tits alternative
Monte Carlo circuits for the abelian permutation group intersection problem
Subcomplete generalizations of graph isomorphism
Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
A time-based solution for the graph isomorphism problem
Colored hypergraph isomorphism is fixed parameter tractable
Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
Completely reachable automata
Choiceless polynomial time on structures with small abelian colour classes
Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
Representing Groups on Graphs
The complexity of intersecting finite automata having few final states
The parallel complexity of graph canonization under abelian group action
scientific article; zbMATH DE number 7559375 (Why is no real title available?)
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
The subpower membership problem for semigroups
On the complexity of deduction modulo leaf permutative equations
Computing the composition factors of a permutation group in polynomial time
Computational complexity of the Weisfeiler-Leman dimension
Computational complexity of the Weisfeiler-Leman dimension

This page was built for publication:

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