Optimal search for rationals
From MaRDI portal
Publication:1007565
DOI10.1016/S0020-0190(02)00455-6zbMATH Open1173.68826MaRDI QIDQ1007565FDOQ1007565
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Cites Work
Cited In (13)
- 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
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms
- 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
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Optimal factorizations of rational numbers using factorization trees 👍 👎
- Optimal probabilistic search 👍 👎
- Search Techniques for Rational Polynomial Orders 👍 👎
- Optimal Search 👍 👎
- Sieving the rationals 👍 👎
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)
