The following pages link to (Q5090494):
Displaying 8 items.
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- On the decision tree complexity of threshold functions (Q2095465) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
- On the Decision Tree Complexity of Threshold Functions (Q5042240) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5918430) (← links)
