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

DOI10.1002/malq.19960420112zbMath0836.03021OpenAlexW1969338778MaRDI QIDQ4868247

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

continued fractionHall theorempolynomial time computabilityCantor theoremrecursive functional

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item

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