On the complexity of computing characters of finite groups

Eberly, WayneHepler, Charles Thomas2005-07-292005-07-291994Hepler, C. T. (1994). On the complexity of computing characters of finite groups (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/16992031599374Xhttp://hdl.handle.net/1880/30155Bibliography: p. 106-112.viii, 112 leaves ; 30 cm.engUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.QA 171 H46 1994Characters of groupsGroup theoryFinite groupsOn the complexity of computing characters of finite groupsmaster thesishttp://dx.doi.org/10.11575/PRISM/16992QA 171 H46 1994