On the public citation graph

The Computational Complexity of Simultaneous Diophantine Approximation Problems

0 signed · 178 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-4730-9_1openalex-snapshot
Knapsack Public Key Cryptosystems and Diophantine Approximation
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02139702openalex-snapshot
On the difference between consecutive primes
inferredcites →https://doi.org/10.1016/0022-0000(78)90044-2openalex-snapshot
NP-Complete decision problems for binary quadratics
inferredcites →https://doi.org/10.1016/0304-3975(75)90016-xopenalex-snapshot
A comparison of polynomial time reducibilities
inferredcites →https://doi.org/10.1090/s0273-0979-1979-14691-3openalex-snapshot
Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
inferredcites →https://doi.org/10.1109/sfcs.1982.5openalex-snapshot
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
inferredcites →https://doi.org/10.1109/tit.1980.1056197openalex-snapshot
On the security of the Merkle- Hellman cryptographic scheme (Corresp.)
inferredcites →https://doi.org/10.1145/800135.804405openalex-snapshot
On the cryptocomplexity of knapsack systems
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/malq.200310099openalex-snapshot
On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
inferred← citeshttps://doi.org/10.1002/net.21983openalex-snapshot
Applications and efficient algorithms for integer programming problems on monotone constraints
inferred← citeshttps://doi.org/10.1006/inco.1998.2762openalex-snapshot
A Lattice-Based Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_469openalex-snapshot
Simplicial Pivoting Algorithms for Integer Programming
inferred← citeshttps://doi.org/10.1007/10704567_18openalex-snapshot
An Operational Semantics of Starlog
inferred← citeshttps://doi.org/10.1007/10720084_1openalex-snapshot
Combining Logic and Optimization in Cutting Plane Theory
inferred← citeshttps://doi.org/10.1007/10722028_1openalex-snapshot
The Complexity of Some Lattice Problems
inferred← citeshttps://doi.org/10.1007/11546245_3openalex-snapshot
Parametrized Greedy Heuristics in Theory and Practice
inferred← citeshttps://doi.org/10.1007/11559306_9openalex-snapshot
An Efficient Decision Procedure for UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/11591191_2openalex-snapshot
Zap: Automated Theorem Proving for Software Analysis
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_14openalex-snapshot
The Shortest Vector Problem in Lattices with Many Cycles
inferred← citeshttps://doi.org/10.1007/3-540-45013-0_7openalex-snapshot
Two Variables per Linear Inequality as an Abstract Domain
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_24openalex-snapshot
Using Fewer Qubits in Shor’s Factorization Algorithm via Simultaneous Diophantine Approximation
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_7openalex-snapshot
The Use of Fractions in Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_11openalex-snapshot
Efficient Algorithms for Integer Programs with Two Variables per Constraint
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_11openalex-snapshot
A New Transference Theorem in the Geometry of Numbers
inferred← citeshttps://doi.org/10.1007/3-540-48892-8_18openalex-snapshot
A Lattice- Based Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_78openalex-snapshot
Integer relations among algebraic numbers
inferred← citeshttps://doi.org/10.1007/3-540-58601-6_92openalex-snapshot
Beyond finite domains
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_70openalex-snapshot
Open problems in number theoretic complexity, II
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_173openalex-snapshot
Approximating good simultaneous Diophantine approximations is almost NP-hard
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_616openalex-snapshot
Simplicial Pivoting Algorithms for Integer Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_79openalex-snapshot
Simplicial Methods for Approximating Fixed Point with Applications in Combinatorial Optimizations
inferred← citeshttps://doi.org/10.1007/978-1-4684-4730-9_1openalex-snapshot
Knapsack Public Key Cryptosystems and Diophantine Approximation
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_17openalex-snapshot
A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_29openalex-snapshot
Trichotomy for the Reconfiguration Problem of Integer Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-52163-8_5openalex-snapshot
Rational Approximations, Multidimensional Continued Fractions, and Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_14openalex-snapshot
Strided Difference Bound Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-12229-8_3openalex-snapshot
Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_28openalex-snapshot
On a Generalization of Horn Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_51openalex-snapshot
Another View of the Gaussian Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_33openalex-snapshot
Lattices with Many Cycles Are Dense
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_26openalex-snapshot
Analyzing Selected Quantified Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_21openalex-snapshot
Splitting the Control Flow with Boolean Flags
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_21openalex-snapshot
Multi-bit Cryptosystems Based on Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_6openalex-snapshot
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_7openalex-snapshot
Selected Applications of LLL in Number Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_8openalex-snapshot
New Hardness Results for Diophantine Approximation
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_2openalex-snapshot
Fully Homomorphic Encryption over the Integers
inferred← citeshttps://doi.org/10.1007/978-3-642-21969-6_15openalex-snapshot
Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_30openalex-snapshot
Sparse Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_20openalex-snapshot
Batch Fully Homomorphic Encryption over the Integers
inferred← citeshttps://doi.org/10.1007/978-3-642-74574-4_7openalex-snapshot
Literaturverzeichnis
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_20openalex-snapshot
Fully Homomophic Encryption over the Integers Revisited
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_21openalex-snapshot
(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
inferred← citeshttps://doi.org/10.1007/978-3-662-54388-7_10openalex-snapshot
FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
inferred← citeshttps://doi.org/10.1007/978-94-009-2794-0_7openalex-snapshot
What Happened with Knapsack Cryptographic Schemes?
inferred← citeshttps://doi.org/10.1007/bf01585160openalex-snapshot
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
inferred← citeshttps://doi.org/10.1007/s00224-004-1220-0openalex-snapshot
Tractable Fragments of Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/s004530010075openalex-snapshot
Efficient Algorithms for Integer Programs with Two Variables per Constraint1
inferred← citeshttps://doi.org/10.1007/s00607-011-0181-9openalex-snapshot
Numeration and discrete dynamical systems
inferred← citeshttps://doi.org/10.1007/s10100-006-0166-5openalex-snapshot
The vehicle routing problem with coupled time windows
inferred← citeshttps://doi.org/10.1007/s10270-012-0294-4openalex-snapshot
Numeric semantics of class diagrams with multiplicity and uniqueness constraints
inferred← citeshttps://doi.org/10.1007/s10479-026-07064-6openalex-snapshot
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems
inferred← citeshttps://doi.org/10.1007/s10703-009-0073-1openalex-snapshot
Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness
inferred← citeshttps://doi.org/10.1007/s10703-017-0314-7openalex-snapshot
Incrementally closing octagons
inferred← citeshttps://doi.org/10.1007/s10817-009-9139-4openalex-snapshot
Optimal Length Resolution Refutations of Difference Constraint Systems
inferred← citeshttps://doi.org/10.1007/s10951-011-0234-0openalex-snapshot
A set partitioning reformulation of a school bus scheduling problem
inferred← citeshttps://doi.org/10.1007/s10990-010-9062-8openalex-snapshot
The two variable per inequality abstract domain
inferred← citeshttps://doi.org/10.1007/s11424-013-1004-1openalex-snapshot
Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
inferred← citeshttps://doi.org/10.1007/s11432-013-4961-zopenalex-snapshot
Exact safety verification of hybrid systems using sums-of-squares representation
inferred← citeshttps://doi.org/10.1007/s11704-014-3150-6openalex-snapshot
Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods
inferred← citeshttps://doi.org/10.1007/s11856-015-1237-xopenalex-snapshot
The convergence of the generalised Selmer algorithm
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90046-9openalex-snapshot
On finite-precision representations of geometric objects
inferred← citeshttps://doi.org/10.1016/0022-314x(86)90104-6openalex-snapshot
Simultaneous Diophantine approximation of rationals by rationals
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90164-3openalex-snapshot
On the complexity of the dual method for maximum balanced flows
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90033-uopenalex-snapshot
Gauss' algorithm revisited
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50020-4openalex-snapshot
Open Problems in Number Theoretic Complexity
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50021-xopenalex-snapshot
10.1016/b978-044488002-4/50021-x
inferred← citeshttps://doi.org/10.1016/j.artint.2012.10.001openalex-snapshot
Computational complexity of linear constraints over the integers
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.004openalex-snapshot
Trichotomy for integer linear systems based on their sign patterns
inferred← citeshttps://doi.org/10.1016/j.dam.2018.04.012openalex-snapshot
Complexity and approximations for submodular minimization problems on two variables per inequality constraints
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.11.001openalex-snapshot
A combinatorial algorithm for Horn programs
inferred← citeshttps://doi.org/10.1016/j.ins.2015.03.019openalex-snapshot
CRT-based fully homomorphic encryption over the integers
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.09.005openalex-snapshot
An improved lower bound for approximating Shortest Integer Relation in norm ()
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.08.002openalex-snapshot
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.01.013openalex-snapshot
Tractability conditions for numeric CSPs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.021openalex-snapshot
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.001openalex-snapshot
Incremental Closure for Systems of Two Variables Per Inequality
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.012openalex-snapshot
Analyzing fractional Horn constraint systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.025openalex-snapshot
Trichotomy for the reconfiguration problem of integer linear systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.02.005openalex-snapshot
Revisiting orthogonal lattice attacks on approximate common divisor problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00216-0openalex-snapshot
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
inferred← citeshttps://doi.org/10.1016/s0167-6377(01)00114-6openalex-snapshot
An efficient algorithm for a class of constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/s0167-6377(03)00074-9openalex-snapshot
Monotonizing linear programs with up to two nonzeroes per column
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00251-1openalex-snapshot
Random lattices, threshold phenomena and efficient reduction algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00616-3openalex-snapshot
The optimal LLL algorithm is still polynomial in fixed dimension
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00118-7openalex-snapshot
On the hardness of approximating shortest integer relations among rational numbers
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)86737-0openalex-snapshot
Local and global relational consistency
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00058-9openalex-snapshot
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00071-1openalex-snapshot
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
inferred← citeshttps://doi.org/10.1017/9781107337534openalex-snapshot
Complexity of Infinite-Domain Constraint Satisfaction
inferred← citeshttps://doi.org/10.1017/etds.2025.10265openalex-snapshot
Dichotomy for the Hausdorff dimension of non-ergodic directions on translation surfaces
inferred← citeshttps://doi.org/10.1023/a:1013847510365openalex-snapshot
Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs
inferred← citeshttps://doi.org/10.1038/s41598-020-67364-0openalex-snapshot
Theory of quantum path computing with Fourier optics and future applications for quantum supremacy, neural networks and nonlinear Schrödinger equations
inferred← citeshttps://doi.org/10.1049/iet-com.2013.1101openalex-snapshot
Cryptanalysis of two cryptosystems based on multiple intractability assumptions
inferred← citeshttps://doi.org/10.1080/09528130903119328openalex-snapshot
On memoryless provers and insincere verifiers
inferred← citeshttps://doi.org/10.1080/10586458.2003.10504711openalex-snapshot
Complex Dimensions of Self-Similar Fractal Strings and Diophantine Approximation
inferred← citeshttps://doi.org/10.1090/conm/290/04577openalex-snapshot
A prime orbit theorem for self-similar flows and Diophantine approximation
inferred← citeshttps://doi.org/10.1093/comjnl/bxab066openalex-snapshot
Cryptanalysis of Modular Exponentiation Outsourcing Protocols
inferred← citeshttps://doi.org/10.1109/ccc.1999.766274openalex-snapshot
Some recent progress on the complexity of lattice problems
inferred← citeshttps://doi.org/10.1109/focs.2017.13openalex-snapshot
Short Presburger Arithmetic Is Hard
inferred← citeshttps://doi.org/10.1109/istcs.1995.377034openalex-snapshot
Computation of highly regular nearby points
inferred← citeshttps://doi.org/10.1109/jiot.2024.3472029openalex-snapshot
Homomorphic Encryption Applications for IoT and Light-Weighted Environments: A Review
inferred← citeshttps://doi.org/10.1109/pacrim.2015.7334830openalex-snapshot
CRT based somewhat homomorphic encryption over the integers
inferred← citeshttps://doi.org/10.1109/rtss.2008.25openalex-snapshot
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365702openalex-snapshot
Algorithmic number theory-the complexity contribution
inferred← citeshttps://doi.org/10.1109/tase.2007.17openalex-snapshot
Consistency and Minimality of UML Class Specifications with Multiplicities and Uniqueness Constraints
inferred← citeshttps://doi.org/10.1134/s2070046614030030openalex-snapshot
Recurrent properties of quasi-periodic dynamical systems with multiple frequencies of p-adic Liouville numbers
inferred← citeshttps://doi.org/10.1134/s207004661604004xopenalex-snapshot
Simultaneous approximation problems of p-adic numbers and p-adic knapsack cryptosystems - Alice in p-adic numberland
inferred← citeshttps://doi.org/10.1137/07069715xopenalex-snapshot
An Arbitrary Starting Homotopy-Like Simplicial Algorithm for Computing an Integer Point in a Class of Polytopes
inferred← citeshttps://doi.org/10.1137/1.9781611973075.83openalex-snapshot
EDF-schedulability of synchronous periodic task systems is coNP-hard
inferred← citeshttps://doi.org/10.1137/1.9781611973105.80openalex-snapshot
Minimizing the number of lattice points in a translated polygon
inferred← citeshttps://doi.org/10.1137/17m1151146openalex-snapshot
Short Presburger Arithmetic Is Hard
inferred← citeshttps://doi.org/10.1137/24m165925xopenalex-snapshot
On the Approximation of Quasiperiodic Functions with Diophantine Frequencies by Periodic Functions
inferred← citeshttps://doi.org/10.1137/s0097539793251876openalex-snapshot
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
inferred← citeshttps://doi.org/10.1142/s0219749913500081openalex-snapshot
QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS
inferred← citeshttps://doi.org/10.1145/1077464.1077476openalex-snapshot
The NP-completeness column
inferred← citeshttps://doi.org/10.1145/1277548.1277577openalex-snapshot
On exact and approximate interpolation of sparse rational functions
inferred← citeshttps://doi.org/10.1145/1993886.1993900openalex-snapshot
Vector rational number reconstruction
inferred← citeshttps://doi.org/10.1145/2016567.2016570openalex-snapshot
Rounding coefficients and artificially underflowing terms in non-numeric expressions
inferred← citeshttps://doi.org/10.1145/2331684.2331701openalex-snapshot
Generating invariants of hybrid systems via sums-of-squares of polynomials with rational coefficients
inferred← citeshttps://doi.org/10.1145/2429069.2429127openalex-snapshot
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
inferred← citeshttps://doi.org/10.1145/2455.2461openalex-snapshot
Solving low-density subset sum problems
inferred← citeshttps://doi.org/10.1145/2480359.2429127openalex-snapshot
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
inferred← citeshttps://doi.org/10.1145/2629424openalex-snapshot
Exact Safety Verification of Hybrid Systems Based on Bilinear SOS Representation
inferred← citeshttps://doi.org/10.1145/3035918.3035948openalex-snapshot
Cryptanalysis of Comparable Encryption in SIGMOD'16
inferred← citeshttps://doi.org/10.1145/73393.73405openalex-snapshot
Towards implementing robust geometric computations
inferred← citeshttps://doi.org/10.1155/2014/475678openalex-snapshot
Preimage Selective Trapdoor Function: How to Repair an Easy Problem
inferred← citeshttps://doi.org/10.1155/2021/8823787openalex-snapshot
Efficient GSW-Style Fully Homomorphic Encryption over the Integers
inferred← citeshttps://doi.org/10.1155/2023/3106927openalex-snapshot
CRT-Based Homomorphic Encryption over the Fraction
inferred← citeshttps://doi.org/10.1287/moor.2014.0708openalex-snapshot
The Linear Complementarity Problems with a Few Variables per Constraint
inferred← citeshttps://doi.org/10.1287/moor.2018.0988openalex-snapshot
The Computational Complexity of Integer Programming with Alternations
inferred← citeshttps://doi.org/10.14569/ijacsa.2018.090316openalex-snapshot
Secure and Privacy Preserving Mail Servers using Modified Homomorphic Encryption (MHE) Scheme
inferred← citeshttps://doi.org/10.14569/ijacsa.2021.0120598openalex-snapshot
Techniques for Solving Shortest Vector Problem
inferred← citeshttps://doi.org/10.15476/elte.2019.089openalex-snapshot
Numerical computing of extremely large values of the Riemann-Siegel Z-function
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10589openalex-snapshot
Teams in Online Scheduling Polls: Game-Theoretic Aspects
inferred← citeshttps://doi.org/10.1613/jair.5658openalex-snapshot
Linear Satisfiability Preserving Assignments
inferred← citeshttps://doi.org/10.17352/amp.000194openalex-snapshot
A Logarithmic Window Algorithm for Constructive Goldbach Representations near the Centre of Large Even Integersc
inferred← citeshttps://doi.org/10.20944/preprints202306.0712.v1openalex-snapshot
Alogrithms for the ACD Problem and Cryptanalysis of ACD-based FHE schemes, Revisited
inferred← citeshttps://doi.org/10.20944/preprints202306.0712.v2openalex-snapshot
Alogrithms for the ACD Problem and Cryptanalysis of ACD-based FHE schemes, Revisited
inferred← citeshttps://doi.org/10.2140/obs.2013.1.167openalex-snapshot
Finding simultaneous Diophantine approximations with prescribed quality
inferred← citeshttps://doi.org/10.21638/11701/spbu01.2016.308openalex-snapshot
NP-completeness conditions for some types of systems of linear diophantine dis-equations consistency checking
inferred← citeshttps://doi.org/10.24033/asens.2573openalex-snapshot
Lévy-Khintchin Theorem for best simultaneous Diophantine approximations
inferred← citeshttps://doi.org/10.2478/ausi-2014-0002openalex-snapshot
Efficient computing of n-dimensional simultaneous Diophantine approximation problems
inferred← citeshttps://doi.org/10.3103/s1063454116030067openalex-snapshot
NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations
inferred← citeshttps://doi.org/10.3103/s1063454117020078openalex-snapshot
NP-complete problems for systems of Linear polynomial’s values divisibilities
inferred← citeshttps://doi.org/10.3390/math11244989openalex-snapshot
AIOL: An Improved Orthogonal Lattice Algorithm for the General Approximate Common Divisor Problem
inferred← citeshttps://doi.org/10.3390/math9060591openalex-snapshot
Quasiperiodic Patterns of the Complex Dimensions of Nonlattice Self-Similar Strings, via the LLL Algorithm
inferred← citeshttps://doi.org/10.37236/29openalex-snapshot
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.989-994.4780openalex-snapshot
The Analysis of Constructing Fully Homomorphic Encryption over Integers
inferred← citeshttps://doi.org/10.4153/cjm-2007-022-3openalex-snapshot
Cyclic Groups and the Three Distance Theorem
inferred← citeshttps://doi.org/10.4171/dms/6openalex-snapshot
Optimization Stories
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.39openalex-snapshot
Fuzzy Simultaneous Congruences
inferred← citeshttps://doi.org/10.48550/arxiv.0807.3355openalex-snapshot
Parallel Approximation and Integer Programming Reformulation
inferred← citeshttps://doi.org/10.48550/arxiv.1001.4455openalex-snapshot
Finding simultaneous Diophantine approximations with prescribed quality
inferred← citeshttps://doi.org/10.48550/arxiv.1010.1945openalex-snapshot
Submodular problems - approximations and algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1210.7417openalex-snapshot
Cryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1708.08179openalex-snapshot
Short Presburger arithmetic is hard
inferred← citeshttps://doi.org/10.48550/arxiv.1808.03033openalex-snapshot
Fractal and Multi-Fractal Analysis for A Family of Subset Sum Functions: Combinatorial Structures of Embedding Dimension $1$
inferred← citeshttps://doi.org/10.48550/arxiv.1911.02786openalex-snapshot
Trichotomy for the reconfiguration problem of integer linear systems
inferred← citeshttps://doi.org/10.48550/arxiv.2005.09836openalex-snapshot
Computations and Complexities of Tarski's Fixed Points and Supermodular Games
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4513openalex-snapshot
On the computational complexity of periodic scheduling
inferred← citeshttps://doi.org/10.5555/2627817.2627897openalex-snapshot
Minimizing the number of lattice points in a translated polygon
inferred← citeshttps://doi.org/10.5555/982792.982958openalex-snapshot
Simultaneous diophantine approximation with excluded primes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.