Solving puzzles related to permutation groups

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Sebastian Egner Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, FRG-76128 Karlsruhe, Germany and Grant GRK 209/2-96 "Beherrschbarkeit komplexer Systeme"
Markus Püschel Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, FRG-76128 Karlsruhe, Germany
Published in:
Cover Image
 
· Proceeding
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Pages 186-193
ACM New York, NY, USA ©1998
table of contents ISBN:1-58113-002-3 doi>10.1145/281508.281611
Solving puzzles related to permutation groups Published by ACM 1998 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 8
· Downloads (12 Months): 29
· Downloads (cumulative): 588
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder