A heuristic subexponential algorithm to find paths in Markoff graphs over finite fields
Crossref DOI link: https://doi.org/10.1007/s40993-024-00582-x
Published Online: 2025-02-06
Published Print: 2025-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Silverman, Joseph H. https://orcid.org/0000-0003-3887-3248
Text and Data Mining valid from 2025-02-06
Version of Record valid from 2025-02-06
Article History
Received: 19 December 2023
Accepted: 9 September 2024
First Online: 6 February 2025