Distributed computing of simultaneous Diophantine approximation problems

MaRDI QIDQ5087239zbMATH OpenFDO

Authors

Publication date 8 July 2022

Full work available at URL http://www.cs.ubbcluj.ro/~studia-m/2014-4/14-tihanyi-final.pdf

zbMATH Keywords

Diophantine approximationrational approximation

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Approximation to algebraic numbers (11J68) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Efficient computing of \(n\)-dimensional simultaneous Diophantine approximation problems
• scientific article; zbMATH DE number 4031798
• Simultaneous diophantine approximation
• Approximating good simultaneous diophantine approximations is almost NP-hard
• The Computational Complexity of Simultaneous Diophantine Approximation Problems

Cited in

(2)

• scientific article; zbMATH DE number 1257082 (Why is no real title available?)
• Efficient computing of \(n\)-dimensional simultaneous Diophantine approximation problems

This page was built for publication: Distributed computing of simultaneous Diophantine approximation problems

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