A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs

Apers, S Auza, A Lee, T

Permalink

Open Access

Copyright Clearance Process

This item is open access.

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Apers, S
dc.contributor.author	Auza, A
dc.contributor.author	Lee, T https://orcid.org/0000-0001-6912-2338
dc.date.accessioned	2022-03-30T20:46:15Z
dc.date.available	2022-03-30T20:46:15Z
dc.date.issued	2021-10-29
dc.identifier.citation	2021
dc.identifier.uri	http://hdl.handle.net/10453/155722
dc.language	en
dc.rights	info:eu-repo/semantics/openAccess
dc.title	A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs
dc.type	preprint
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/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	open_access	*
dc.date.updated	2022-03-30T20:46:13Z

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