Analyse de complexité pour un théorème de Hall sur les fractions continues

DOI10.1002/MALQ.19960420112MaRDI QIDQ4868247zbMATH OpenOpenAlexFDO

Authors Salah Labhalla, Henri Lombardi

Publication date 2 May 1996

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19960420112

zbMATH Keywords

Cantor theoremcontinued fractionHall theorempolynomial time computabilityrecursive functional

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Constructive and recursive analysis (03F60) Continued fractions (11A55) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On a generalization of Hall's theorem for sums of continued fractions
• On a theorem of M. Hall
• Real numbers, continued fractions and complexity classes
• scientific article; zbMATH DE number 4135939

Cited in

(3)

• On a generalization of Hall's theorem for sums of continued fractions
• On a theorem of M. Hall
• The repetends of reduced fractions a/b^k approach full complexity with an increasing k

This page was built for publication: Analyse de complexité pour un théorème de Hall sur les fractions continues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868247)