The Computational Complexity of Simultaneous Diophantine Approximation Problems
- 1 February 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (1), 196-209
- https://doi.org/10.1137/0214016
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Knapsack Public Key Cryptosystems and Diophantine ApproximationPublished by Springer Nature ,1984
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- On the security of the Merkle- Hellman cryptographic scheme (Corresp.)IEEE Transactions on Information Theory, 1980
- On the difference between consecutive primesInventiones Mathematicae, 1979
- Generalization of the Euclidean algorithm for real numbers to all dimensions higher than twoBulletin of the American Mathematical Society, 1979
- On the cryptocomplexity of knapsack systemsPublished by Association for Computing Machinery (ACM) ,1979
- NP-Complete decision problems for binary quadraticsJournal of Computer and System Sciences, 1978
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975