Pages that link to "Item:Q3937164"

The following pages link to Dynamic Programming is Optimal for Nonserial Optimization Problems (Q3937164):

Displaying 10 items.

• A stronger model of dynamic programming algorithms (Q547305) (← links)
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
• The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
• Systolic processing for dynamic programming problems (Q1099090) (← links)
• Nonserial dynamic programming formulations of satisfiability (Q1099093) (← links)
• Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
• Dynamic programming is optimal for certain sequential decision processes (Q1139505) (← links)
• Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
• A Comprehensive Model of Dynamic Programming (Q3678966) (← links)
• Power indices and easier hard problems (Q5751941) (← links)