Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard

Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard
复制标题

近似良好的同时丢番图近似几乎是 NP 困难的

DOI:
--
复制
发表时间:
1996
期刊:
International Symposium on Mathematical Foundations of Computer Science
影响因子:
--
通讯作者:
Jean
Jean
中科院分区:
--
文献类型:
--
作者:
Carsten Rössner;Jean

文献摘要

被引文献

相似文献

Given a real vector α=(α1,..., α d ) and a real number e>0 a good Diophantine approximation to α is a number Q such that ∥Qα mod ℤ∥∞ ≤e, where ∥ · ∥∞ denotes the l∞-norm ∥x∥t8 ≔ max1 ≤i≤d ¦ xi¦ for x=(x1,..., xd).