Approximating good simultaneous diophantine approximations is almost NP-hard
2005
Online
Electronic Resource
Given a real vector alpha =(alpha1 ; : : : ; alpha d ) and a real number E > 0 a good Diophantine approximation to alpha is a number Q such that IIQ alpha mod Zk1 ", where k \Delta k1 denotes the 1-norm kxk1 := max 1id jx i j for x = (x1 ; : : : ; xd ). Lagarias [12] proved the NP-completeness of the corresponding decision problem, i.e., given a vector ff 2 Q d , a rational number " ? 0 and a number N 2 N+ , decide whether there exists a number Q with 1 Q N and kQff mod Zk1 ". We prove that, unless ...
Title: |
Approximating good simultaneous diophantine approximations is almost NP-hard
|
---|---|
Author / Contributor: | Rössner, Carsten ; Seifert, Jean-Pierre |
Link: | |
Publication: | 2005 |
Media Type: | Electronic Resource |
Subject heading: |
|
Additional details: |
|