Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Carsten Rössner
On the Hardness of Approximating Shortest Integer Relations Among Rational Numbers
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Approximating Good Simultaneous Diophantine Approximations Is Almost NP-hard
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Hypercomplex Polynomials, Vietoris’ Rational Numbers and a Related Integer Numbers Sequence
Complex Analysis and Operator Theory
Mathematics
Computational Mathematics
Applied Mathematics
Computational Theory
Shortest Integer Vectors
Mathematics of Operations Research
Management Science
Computer Science Applications
Operations Research
Mathematics
On the Approximation of Irrational Numbers by Rational Numbers
Japanese journal of mathematics :transactions and abstracts
Approximating Shortest Paths in Spatial Social Networks
On the G-Compactifications of the Rational Numbers
Monatshefte fur Mathematik
Mathematics
Hardness of Approximating the Minimum Distance of a Linear Code
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Constant Coefficient Linear Difference Equations on the Rational Cones of the Integer Lattice
Siberian Mathematical Journal
Mathematics
On the Number of Good Rational Approximations to Algebraic Numbers
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
