Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Computational group theory

In mathematics, computational group theory is the study ofgroups by means of computers. It is concernedwith designing and analysing algorithms… Expand
Wikipedia

Related topics

Related topics

15 relations
AlgorithmBlack box groupCharles Sims (mathematician)Computational mathematics
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Handbook of Computational Group Theory
History of Computational Group Theory BACKGROUND MATERIALS Fundamentals Group Actions Series Presentation of Groups Presentation… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Symmetry Reductions in Model-Checking
Symmetries occur in different forms in concurrent programs. Such symmetries are induced by processes that behave similarly, and… Expand
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Generic SBDD Using Computational Group Theory
We introduce a novel approach for symmetry breaking by dominance detection (SBDD). The essence of SBDD is to perform 'dominance… Expand
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
1998
1998
Simple Groups in Computational Group Theory
This note describes recent research using structural properties of finite groups to devise efficient algorithms for group… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Symmetry and Model Checking
We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A Recognition Algorithm for Special Linear Groups
contain th speciase l linea SL(rfr grou, q).pAmplifying the problem he said he would be happy to have a program that couldbe used… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Designing Fault-Tolerant System Using Automorphisms
Abstract This paper presents a general theory for modeling and designing fault-tolerant multiprocessor systems in a systematic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Permutation Group Algorithms Based on Partitions, I: Theory and Algorithms
  • J. S. Leon
  • J. Symb. Comput.
  • 1991
    • Corpus ID: 206085946
A technique for computing in permutation groups of high degree is developed. The technique uses the idea of successive refinement… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Nonstandard Analysis and its Applications: Contents
 
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Computational complexity and the classification of finite simple groups
We address the graph isomorphism problem and related fundamental complexity problems of computational group theory. The main… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE