Efficient search for rationals
From MaRDI portal
Publication:1259410
DOI10.1016/0020-0190(79)90079-6zbMath0411.65037OpenAlexW1990480988MaRDI QIDQ1259410
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90079-6
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Radix representation; digital problems (11A63) Numerical methods for mathematical programming, optimization and variational techniques (65K99)
Related Items
Finding extrema with unary predicates, Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons, A finite algorithm for the continuousp-center location problem on a graph, Operations research applications of dichotomous search, On measuring inconsistency in definite and indefinite databases with denial constraints, On search over rationals, The complexity of linear programming, The complexity of linear programming, Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches, Ratio-balanced maximum flows, Rational search, Optimal search for rationals, Faster algorithms for quantitative verification in bounded treewidth graphs, An O(n) algorithm for the linear multiple choice knapsack problem and related problems, Continuous bottleneck tree partitioning problems, On the non-polynomiality of the relaxation method for systems of linear inequalities, Convergence of a cyclic ellipsoid algorithm for systems of linear equalities, Searching and encoding for infinite ordered sets, Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
Cites Work
