pdfformat: 

@InProceedings{chattopadhyay_et_al:LIPIcs:2010:2874, author = {Arkadev Chattopadhyay and Jacobo Tor{\'a}n and Fabian Wagner}, title = {{Graph Isomorphism is not AC^0 reducible to Group Isomorphism}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)}, pages = {317326}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897231}, ISSN = {18688969}, year = {2010}, volume = {8}, editor = {Kamal Lodaya and Meena Mahajan}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2874}, URN = {urn:nbn:de:0030drops28748}, doi = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.317}, annote = {Keywords: Complexity, Algorithms, Group Isomorphism Problem, Circuit Com plexity} }
Keywords:  Complexity, Algorithms, Group Isomorphism Problem, Circuit Com plexity  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)  
Issue date:  2010  
Date of publication:  2010 