Pages that link to "Item:Q460604"
From MaRDI portal
The following pages link to Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604):
Displaying 8 items.
- Discovering implied constraints in precedence graphs with alternatives (Q613781) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)