On the complexity of epimorphism testing with virtually abelian targets

Elder, M

Shen, J Weiß, A

Permalink

Open Access

Copyright Clearance Process

This item is open access.

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Elder, M https://orcid.org/0000-0002-2438-3945
dc.contributor.author	Shen, J
dc.contributor.author	Weiß, A
dc.date.accessioned	2025-10-08T01:08:18Z
dc.date.available	2025-10-08T01:08:18Z
dc.date.issued	2025-01-10
dc.identifier.citation	2025
dc.identifier.uri	http://hdl.handle.net/10453/190309
dc.language	en
dc.rights	info:eu-repo/semantics/openAccess
dc.title	On the complexity of epimorphism testing with virtually abelian targets
dc.type	preprint
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Science
pubs.organisational-group	University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	open_access	*
dc.rights.license	This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0). To view a copy of this license, visit https://creativecommons.org/licenses/by/4.0/
dc.date.updated	2025-10-08T01:08:16Z

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