This paper first exposes some of the defects in the interval arithmetic algorithms of Moore and Krückeberg. Then it identifies classes of problems on which these algorithms compute "optimum bounds".
Distance geometry is an essential field in computational mathematics and structural biology, providing the theoretical foundation and practical algorithms required to reconstruct the three‐dimensional ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback