The Computational Complexity of Simultaneous Diophantine Approximation Problems
From MaRDI portal
Recommendations
Cited in
(69)- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
- On the complexity of the dual method for maximum balanced flows
- Tractability conditions for numeric CSPs
- Local and global relational consistency
- Complex Dimensions of Self-Similar Fractal Strings and Diophantine Approximation
- Effective simultaneous approximability of reals.
- The optimal LLL algorithm is still polynomial in fixed dimension.
- Incremental closure for systems of two variables per inequality
- Numeration and discrete dynamical systems
- Incrementally closing octagons
- On the approximation of quasiperiodic functions with Diophantine frequencies by periodic functions
- The Complexity of the Diagonal Problem for Recursion Schemes
- Applications and efficient algorithms for integer programming problems on monotone constraints
- An efficient algorithm for a class of constraint satisfaction problems
- On memoryless provers and insincere verifiers
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- An improved lower bound for approximating shortest integer relation in \(\ell _{\infty }\) norm \((SIR_{\infty })\)
- The computational complexity of integer programming with alternations
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- On the hardness of approximating shortest integer relations among rational numbers
- CRT-based fully homomorphic encryption over the integers
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- On finite-precision representations of geometric objects
- Optimal length resolution refutations of difference constraint systems
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- scientific article; zbMATH DE number 599115 (Why is no real title available?)
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Efficient computing of \(n\)-dimensional simultaneous Diophantine approximation problems
- Splitting the Control Flow with Boolean Flags
- A combinatorial algorithm for Horn programs
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- Diffraction measures and patterns of the complex dimensions of self-similar fractal strings. I: The lattice case
- Rational approximations, multidimensional continued fractions, and lattice reduction
- The vehicle routing problem with coupled time windows
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- The convergence of the generalised Selmer algorithm
- Dichotomy for the Hausdorff dimension of non-ergodic directions on translation surfaces
- Recurrent properties of quasi-periodic dynamical systems with multiple frequencies of \(p\)-adic Liouville numbers
- Using the inhomogeneous simultaneous approximation problem for cryptographic design
- QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS
- Constraint satisfaction problems over numeric domains
- The complexity of almost linear diophantine problems
- On a generalization of Horn constraint systems
- Distributed computing of simultaneous Diophantine approximation problems
- Random lattices, threshold phenomena and efficient reduction algorithms.
- Trichotomy for integer linear systems based on their sign patterns
- Selected applications of LLL in number theory
- The two variable per inequality abstract domain
- Parameterized algorithms for block-structured integer programs with large entries
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints
- scientific article; zbMATH DE number 1113848 (Why is no real title available?)
- Short Presburger Arithmetic Is Hard
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- The Linear Complementarity Problems with a Few Variables per Constraint
- Monotonizing linear programs with up to two nonzeroes per column
- A set partitioning reformulation of a school bus scheduling problem
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods
- Simultaneous approximation problems of p-adic numbers and p-adic knapsack cryptosystems -- Alice in p-adic numberland
- New Hardness Results for Diophantine Approximation
- Signatures through approximate representations by quadratic forms
- NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations
- A lattice-based public-key cryptosystem
- Exact safety verification of hybrid systems using sums-of-squares representation
- Analyzing fractional Horn constraint systems
- Simultaneous diophantine approximation of rationals by rationals
- Preimage selective trapdoor function: how to repair an easy problem
This page was built for publication: The Computational Complexity of Simultaneous Diophantine Approximation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3676213)
