Author/Authors :
Richard E. Stearns، نويسنده , , Harry B. Hunt III، نويسنده ,
Keywords :
Non-serial dynamic programming , Channelwidth , Structure trees , Constraint satisfaction problems , Treewidth , tree decompositions , Quantified formulas , computational complexity , Generic algorithms , Satisfiability problems
