Skip to search formSkip to main contentSkip to account menu

Todd–Coxeter algorithm

Known as: Todd-Coxeter algorithm, Todd–Coxeter process, Todd–Coxeter 
In group theory, the Todd–Coxeter algorithm, created by J. A. Todd and H. S. M. Coxeter in 1936, is an algorithm for solving the coset enumeration… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Resumen es: Los estreptococos betahemoliticos son bacterias capaces de producir patologias graves y cuadros clinicos con secuelas… 
2009
2009
Objectives To assess whether there is: a) a clinical difference between patients with cellulitis treated according to the… 
2003
2003
A base and strong generating set provides an effective computer representation for a permutation group. This representation helps… 
2003
2003
Andrews and Curtis have conjectured that every balanced presentation of the trivial group can be transformed into a standard… 
2001
2001
Sharon Todd’s thought-provoking essay gives sensitive and careful attention to a thinker whose significance for education is very… 
2001
2001
Abstract.Global and local convergence properties of a primal-dual interior-point pure potential-reduction algorithm for linear… 
2000
2000
A local acceleration method for primal-dual potential-reduction algorithms is introduced. The method developed here uses modified… 
1991
1991
A group can be described by means of a presentation in generators and relations. The generators are the building blocks from…