skip to content
Polynomial-time algorithms for permutation groups Preview this item
ClosePreview this item
Checking...

Polynomial-time algorithms for permutation groups

Author: Merrick Lee Furst; John E Hopcroft; Eugene Luks
Publisher: Ithaca, N.Y. : Dept. of Computer Science, Cornell University, 1980.
Series: Technical report (Cornell University. Department of Computer Science), TR 80-442.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal closure of a subgroup can be computed in polynomial time,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Merrick Lee Furst; John E Hopcroft; Eugene Luks
OCLC Number: 63578955
Notes: Typescript.
Description: 15 pages ; 28 cm.
Series Title: Technical report (Cornell University. Department of Computer Science), TR 80-442.
Responsibility: Merrick Furst, John Hopcroft, Eugene Luks.

Abstract:

A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal closure of a subgroup can be computed in polynomial time, and that this procedure can be used to test a group for solvability. We also describe an approach to computing the intersection of two groups. The procedures and techniques have wide applicability and have recently been used to improve many graph isomorphism algorithms.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/63578955>
library:oclcnum"63578955"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1980"
schema:description"A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal closure of a subgroup can be computed in polynomial time, and that this procedure can be used to test a group for solvability. We also describe an approach to computing the intersection of two groups. The procedures and techniques have wide applicability and have recently been used to improve many graph isomorphism algorithms."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/137207134>
schema:inLanguage"en"
schema:isPartOf
schema:name"Polynomial-time algorithms for permutation groups"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.