Efficient algorithm for reduction by continued-fraction expansion about s = 0 and s = a

T. Nigel Lucas

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Fingerprint Dive into the research topics of 'Efficient algorithm for reduction by continued-fraction expansion about <i>s</i> = 0 and <i>s</i> = a'. Together they form a unique fingerprint.