Two approaches to the extension problem for arbitrary weights over finite module alphabets
Crossref DOI link: https://doi.org/10.1007/s00200-020-00465-5
Published Online: 2020-10-12
Published Print: 2021-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Wood, Jay A.
Text and Data Mining valid from 2020-10-12
Version of Record valid from 2020-10-12
Article History
Received: 20 January 2020
Accepted: 10 September 2020
First Online: 12 October 2020