Pages that link to "Item:Q3502704"

The following pages link to Computation of Renameable Horn Backdoors (Q3502704):

Displaying 2 items.

• Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
• Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)