Polynomial-Time Isomorphism Test of Groups that are Tame Extensions

Grochow, JA Qiao, Y

Permalink

Open Access

Copyright Clearance Process

This item is open access.

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Grochow, JA	en_US
dc.contributor.author	Qiao, Y https://orcid.org/0000-0003-4334-1449	en_US
dc.date.issued	2015	en_US
dc.identifier.citation	Algorithms and Computation, 2015, pp. 578 - 589	en_US
dc.identifier.isbn	9783662489703	en_US
dc.identifier.uri	http://hdl.handle.net/10453/138115
dc.publisher	Springer Berlin Heidelberg	en_US
dc.relation.ispartof	Algorithms and Computation	en_US
dc.relation.isbasedon	10.1007/978-3-662-48971-0_49	en_US
dc.rights	This is a post-peer-review, pre-copyedit version of an article published in Algorithms and Computation. The final authenticated version is available online at: https://dx.doi.org/10.1007/978-3-662-48971-0_49.	en_US
dc.rights	info:eu-repo/semantics/openAccess
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Polynomial-Time Isomorphism Test of Groups that are Tame Extensions	en_US
dc.type	Chapter
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	open_access	*
pubs.publication-status	Published	en_US

Please use this identifier to cite or link to this item: