Editing Sylow theorems (section)

=== Algorithms ===
* {{Cite book |last=Butler |first=G. |date=1991 |title=Fundamental Algorithms for Permutation Groups |series=[[Lecture Notes in Computer Science]] |volume=559 |location=Berlin, New York City |publisher=[[Springer-Verlag]] |doi=10.1007/3-540-54955-2 |isbn=9783540549550 |mr=1225579 |zbl=0785.20001
|s2cid=395110 }}
* {{Cite book |last=Cannon |first=John J. |date=1971 |chapter=Computing local structure of large finite groups |title=Computers in Algebra and Number Theory (<abbr title="Proceedings of a SIAM-AMS Symposium in Applied Mathematics">Proc. SIAM-AMS Sympos. Appl. Math.</abbr>, New York City, 1970) |series=<abbr title="SIAM-AMS Proceedings">SIAM-AMS Proc.</abbr> |volume=4 |location=Providence RI |publisher=[[American Mathematical Society|AMS]] |pages=161–176 |issn=0160-7634 |mr=0367027 |zbl=0253.20027
}}
* {{Cite journal |last=Kantor |first=William M. |date=1985a |title=Polynomial-time algorithms for finding elements of prime order and Sylow subgroups |journal=<abbr Title="Journal of Algorithms">J. Algorithms</abbr> |volume=6 |issue=4 |pages=478–514 |doi=10.1016/0196-6774(85)90029-X |issn=0196-6774 |mr=813589 |zbl=0604.20001 |citeseerx=10.1.1.74.3690 |url=http://uoregon.edu/~kantor/PAPERS/primeorder.pdf 
}}
* {{Cite journal |last=Kantor |first=William M. |author-link=William Kantor |date=1985b |title=Sylow's theorem in polynomial time |journal=<abbr Title="Journal of Computer and System Sciences">J. Comput. Syst. Sci.</abbr> |volume=30 |issue=3 |pages=359–394 |doi=10.1016/0022-0000(85)90052-2 |issn=1090-2724 |mr=805654 |zbl=0573.20022
|doi-access=free }}
* {{Cite journal |last1=Kantor |first1=William M. |last2=Taylor |first2=Donald E. |date=1988 |title=Polynomial-time versions of Sylow's theorem |journal=<abbr Title="Journal of Algorithms">J. Algorithms</abbr> |volume=9 |issue=1 |pages=1–17 |doi=10.1016/0196-6774(88)90002-8 |issn=0196-6774 |mr=925595 |zbl=0642.20019
}}
* {{Cite journal |last=Kantor |first=William M. |date=1990 |title=Finding Sylow normalizers in polynomial time |journal=<abbr Title="Journal of Algorithms">J. Algorithms</abbr> |volume=11 |issue=4 |pages=523–563 |doi=10.1016/0196-6774(90)90009-4 |issn=0196-6774 |mr=1079450 |zbl=0731.20005
}}
* {{Cite book |last=Seress |first=Ákos |date=2003 |title=Permutation Group Algorithms |series=Cambridge Tracts in Mathematics |volume=152 |publisher=[[Cambridge University Press]] |isbn=9780521661034 |mr=1970241 |zbl=1028.20002}}