Document is current

Any future updates will be listed below

An Exact Quantum Polynomial-Time Algorithm for Solving k-Junta Problem with One Uncomplemented Product

Crossref DOI link: https://doi.org/10.1007/s10773-022-04990-6

Published Online: 2022-03-12

Published Print: 2022-03

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark