Pages that link to "Item:Q1854544"
From MaRDI portal
The following pages link to Preprocessing of intractable problems (Q1854544):
Displaying 12 items.
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- On the complexity of second-best abductive explanations (Q899129) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Knowledge Compilation with Empowerment (Q2891394) (← links)
- On the complexity of existential positive queries (Q5410336) (← links)
- On the complexity of case-based planning (Q5704532) (← links)
- Sublinear-time reductions for big data computing (Q5918726) (← links)
- Common equivalence and size of forgetting from Horn formulae (Q6661056) (← links)
