Document is current

Any future updates will be listed below

Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion

Crossref DOI link: https://doi.org/10.1007/s10107-020-01516-y

Published Online: 2020-05-25

Published Print: 2021-07

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

About CrossMark