Pages that link to "Item:Q430838"
From MaRDI portal
The following pages link to Toward a model for backtracking and dynamic programming (Q430838):
Displaying 18 items.
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Lower bounds for \(k\)-DNF resolution on random 3-CNFs (Q430840) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- (Q5090377) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- Advice complexity of priority algorithms (Q5916086) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
