Approximating Good Simultaneous Diophantine Approximations Is Almost NP-hard

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-61550-4_173
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Best Simultaneous Diophantine Approximations. II. Behavior of Consecutive Best Approximations

Pacific Journal of Mathematics
Mathematics
1982English

Diophantine Approximations

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1964English

Automating Resolution Is NP-Hard

2019English

On Diophantine Approximations

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1961English

Optimizing Pred(25) Is NP-Hard

Studies in Systems, Decision and Control
ControlSystems EngineeringFinanceAutomotive EngineeringDecision SciencesEconomicsEconometricsOptimizationComputer ScienceSocial Sciences
2017English

Best Simultaneous Diophantine Approximations. I. Growth Rates of Best Approximation Denominators

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Tile-Packing Tomography Is $\Mathbb{NP}$ -Hard

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2011English

Computing the Interleaving Distance Is NP-Hard

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2019English

Maximum Algebraic Connectivity Augmentation Is NP-hard

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy