The following pages link to Optimal search for rationals (Q1007565):
Displaying 13 items.
- Improved bounds for the CF algorithm (Q385006) (← links)
- Parametric integer programming algorithm for bilevel mixed integer programs (Q711715) (← links)
- Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons (Q834601) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Exact quantitative probabilistic model checking through rational search (Q2225475) (← links)
- On a class of covering problems with variable capacities in wireless networks (Q2339450) (← links)
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
- A note on the approximation of mean-payoff games (Q2446598) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- Characteristic function games with restricted agent interactions: core-stability and coalition structures (Q2634475) (← links)
- Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata (Q2988371) (← links)
