A bounded-error quantum polynomial-time algorithm for two graph bisection problems
Crossref DOI link: https://doi.org/10.1007/s11128-015-1069-y
Published Online: 2015-07-14
Published Print: 2015-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Younes, Ahmed
Text and Data Mining valid from 2015-07-14