scientific article
From MaRDI portal
zbMath0462.05059MaRDI QIDQ3912839
John E. Hopcrofts, Merrick L. Furst, Eugene M. Luks
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The subpower membership problem for semigroups, Representing Groups on Graphs, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Choiceless Polynomial Time on Structures with Small Abelian Colour Classes, Parallel algorithms for solvable permutation groups, The complexity of intersecting finite automata having few final states, The parallel complexity of graph canonization under abelian group action, A time-based solution for the graph isomorphism problem, Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs, 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, Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas, Polynomial time recognition and testing of isomorphism of cyclic tournaments, Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments, Colored hypergraph isomorphism is fixed parameter tractable, Graph isomorphism is low for PP, On the complexity of deduction modulo leaf permutative equations, Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable, Unnamed Item, Computing the composition factors of a permutation group in polynomial time, Monte Carlo circuits for the abelian permutation group intersection problem, Completely Reachable Automata, Algorithms for matrix groups and the Tits alternative, Subcomplete generalizations of graph isomorphism, Graph isomorphism problem
