This work presents a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory, and discusses methods for generating partial symmetry-breaking predicates, and shows that in several speciic cases asymmetries can be broken either fully or partially using a polynomial number of predicates.Expand

An algebraic approach to the problem of assigning canonical forms to graphs by computing canonical forms and the associated canonical labelings in polynomial time is announced.Expand

Testing isomorphism of graphs of valence ≤ t is polynomial-time reducible to the color automorphism problem for groups with small simple sections, and some results on primitive permutation groups are used to show that the algorithm runs inPolynomial time.Expand

It is demonstrated that the normal closure of a subgroup can be computed in polynomial time, and that this proceaure can be used to test a group for solvability.Expand

Abstract Suppose L is a finite-dimensional Lie algebra with multiplication μ: L ∧ L → L . Let Δ( L ) denote the set of triples ( f , f ′, f ″), with f , f ′, f ″ ∈ Hom( L , L ), such that μ ∘… Expand

It appears that unless there is another radical breakthrough in ISO, independent of the previous one, the simple groups classification is an indispensable tool for further developments.Expand

This work considers the solvability of the equation and generalizations, where the A{sub i} and B are given commuting matrices over an algebraic number field F, and gives an explicit description of the set of all solutions (as an affine lattice).Expand

It is shown that the basic problems of permutation group manipulation admit efficient parallel solutions and that isomorphism of graphs with bounded multiplicity of eigenvalues is in NC.Expand

The author shows that solvability and nilpotence can be tested in polynomial-time, and announces methods for efficient management of solvable matrix groups over finite fields.Expand