Optimal search for rationals

DOI10.1016/S0020-0190(02)00455-6zbMATH Open1173.68826MaRDI QIDQ1007565FDOQ1007565

Authors: K. Mehlhorn, Stephen S. Kwek 

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• Publication:4938782
• scientific article; zbMATH DE number 18751
• Optimization of rational approximations by continued fractions
• Sieving the rationals
• scientific article; zbMATH DE number 4040006
• Search Techniques for Rational Polynomial Orders
• scientific article; zbMATH DE number 3990213
• Optimal probabilistic search
• Optimal factorizations of rational numbers using factorization trees
• Optimal Search

zbMATH Keywords

algorithmsbinary searchcombinatorial algorithmsrational numbers

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On search over rationals
• Rational search
• Efficient search for rationals
• An optimal algorithm for finding all the jumps of a monotone step-function
• A generalization of binary search

Cited In (12)

• Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
• On a class of covering problems with variable capacities in wireless networks
• Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons
• On the complexity of real root isolation using continued fractions
• Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
• Parametric integer programming algorithm for bilevel mixed integer programs
• Faster algorithms for quantitative verification in bounded treewidth graphs
• Operations research applications of dichotomous search
• Exact quantitative probabilistic model checking through rational search
• A note on the approximation of mean-payoff games
• Characteristic function games with restricted agent interactions: core-stability and coalition structures
• Improved bounds for the CF algorithm

This page was built for publication: Optimal search for rationals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007565)