Rational search

DOI10.1016/0020-0190(79)90150-9zbMath0393.68068OpenAlexW4233995166MaRDI QIDQ1252036

Steven P. Reiss

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)90150-9

zbMATH Keywords

Binary SearchRational Search

Mathematics Subject Classification ID

Linear programming (90C05) Search theory (90B40) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items

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, A Fourth bibliography of fractional programming, On search over rationals, Uniqueness in quadratic and hyperbolic \(0-1\) programming problems, Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches, Optimal search for rationals, An O(n) algorithm for the linear multiple choice knapsack problem and related problems, Continuous bottleneck tree partitioning problems, Searching and encoding for infinite ordered sets, Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games, Bibliography in fractional programming

Cites Work

• Efficient search for rationals
• The complexity of linear programming
• Unnamed Item
• Unnamed Item