A fast cyclic base change for permutation groups

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A fast cyclic base change for permutation groups

Full text

Pdf (1.03 MB)

Source

International Conference on Symbolic and Algebraic Computation archive
Papers from the international symposium on Symbolic and algebraic computation table of contents

Berkeley, California, United States

Pages: 224 - 232

Year of Publication: 1992

ISBN:0-89791-489-9

Authors

Gene Cooperman
Larry Finkelstein

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 8, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/143242.143316 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	L. Babai, "Monte-Carlo Algorithms in Graph Isomorphism Testing", Universit6 de Montr6aI Tech. Report D.M.S. 79-10 (1979), Dep. Math. et. St, at.
	2	László Babai , Gene Cooperman , Larry Finkelstein , Eugene Luks , Ákos Seress, Fast Monte Carlo algorithms for permutation groups, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.90-100, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103435]
	3	László Babai , Gene Cooperman , Larry Finkelstein , Ákos Seress, Nearly linear time algorithms for permutation groups with a small base, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.200-209, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120724]
	4	L. Bahai and E. Szemer6di, "On the Complexity of Matrix Group Problems I '" Proc. 25th IEEE FOCS (1984), Palm Beach, FL. pp. 229-2-t0.
	5	C. A. Brown , L. Finkelstein , P. W. Purdom, Jr., A new base change algorithm for permutation groups, SIAM Journal on Computing, v.18 n.5, p.1037-1047, Oct. 1989 [doi>10.1137/0218070]
	6	Cynthia A. Brown , Larry Finkelstein , Paul Walton Purdom, Jr., Backtrack Searching in the Presence of Symmetry, Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.99-110, July 04-08, 1988
	7	G Butler , C W H Lam, A general backtrack algorithm for the isomorphism problem of combinatorial objects, Journal of Symbolic Computation, v.1 n.4, p.363-381, Dec. 1985 [doi>10.1016/S0747-7171(85)80021-3]
	8	J..} Caution, ~An Introductaon to the Group Theory Language, Ca.yley", iu C'omputational Grol~p Theoiy, edited by M.D. At.klnson, Aca.demlc PIess, 198i, pp. 145-18.t
	9	H. Chet~o{{, "A Measure of As~lllI~toti( Efflcieltc3 for Tests of a Ilypot}~es}s Based o~ the Snn~ o{ Obsclvations", ~'~1sna/s of Math Statistics 23, 1952. pp ,it)3- 507.
	10	Gene Cooperman , Larry Finkelstein, New methods for using Cayley graphs in interconnection networks, Discrete Applied Mathematics, 37-38, p.95-118, July 15, 1992 [doi>10.1016/0166-218X(92)90127-V]
	11	Gene Cooperman , Larry Finkelstein, A strong generating test and short presentations for permutation groups, Journal of Symbolic Computation, v.12 n.4-5, p.475-497, Oct./Nov. 1991 [doi>10.1016/S0747-7171(08)80099-5]
	12	Gene Cooperman , Larry Finkelstein, A random base change algorithm for permutation groups, Journal of Symbolic Computation, v.17 n.6, p.513-528, June 1994 [doi>10.1006/jsco.1994.1032]
	13	G. Cooperman , L. Finkelstein , E. Luks, Reduction of group constructions to point stabilizers, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.351-356, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74581]
	14	G. Cooperman , L. Finkelstein , N. Sarawagi, A random base change algorithm for permutation groups, Proceedings of the international symposium on Symbolic and algebraic computation, p.161-168, August 20-24, 1990, Tokyo, Japan [doi>10.1145/96877.96918]
	15	Mark Jerrum, A compact representation for permutation groups, Journal of Algorithms, v.7 n.1, p.60-78, March 1986 [doi>10.1016/0196-6774(86)90038-6]
	16	C. W. H. Lam, The search for a finite projective plane of order 10, American Mathematical Monthly, v.98 n.4, p.305-318, Apirl 1991 [doi>10.2307/2323798]
	17	J. Leon, "On an Algorithm for Finding a Base and Stiong Generating Set for a Group Given by a Set of Generating Permutations", Math. Comp. 35 (t980), pp. 941-974.
	18	J. Leon, "Computing Automorphism Groups of Combinatorial Objects", in Computa.tional Gro~p Theory, edited by M. D. Atkinson, Academic Press (1984), pp. 321-337.
	19	Charles C. Sims, Computation with permutation groups, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.23-28, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806264]