Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On doing Todd-Coxeter coset enumeration in parallel

From MaRDI portal
Publication:1182307
Jump to:navigation, search

DOI10.1016/0166-218X(91)90076-9zbMath0813.20034OpenAlexW1963747419MaRDI QIDQ1182307

S. Singh

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90076-9

zbMATH Keywords

computational group theoryTodd-Coxeter coset enumeration


Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Software, source code, etc. for problems pertaining to group theory (20-04)


Related Items

Scalable parallel coset enumeration: bulk definition and the memory wall



Cites Work

  • Implementation and Analysis of the Todd-Coxeter Algorithm
  • A practical method for enumerating cosets of a finite abstract group
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1182307&oldid=12041650"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki