Pages that link to "Item:Q814421"
From MaRDI portal
The following pages link to Parameterized complexity of constraint satisfaction problems (Q814421):
Displaying 32 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Parameterized proof complexity (Q451111) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
- Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
- Completely inapproximable monotone and antimonotone parameterized problems (Q1936258) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting (Q2805407) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678) (← links)
- Constraint Satisfaction Parameterized by Solution Size (Q3012823) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- On the Space Complexity of Parameterized Problems (Q4899254) (← links)
- Complexity Results for Linear XSAT-Problems (Q4930593) (← links)
- Polynomial time termination and constraint satisfaction tests (Q5055810) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- Theory and Applications of Satisfiability Testing (Q5325861) (← links)
- Parameterized Complexity of Graph Constraint Logic (Q5363782) (← links)
- Complexity and Approximability of Parameterized MAX-CSPs (Q5363783) (← links)
- On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances (Q5369245) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492890) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892172) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)