Pages that link to "Item:Q2805407"
From MaRDI portal
The following pages link to Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting (Q2805407):
Displaying 11 items.
- Parameterized complexity of constraint satisfaction problems (Q814421) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- W-hierarchies defined by symmetric gates (Q970108) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- Completely inapproximable monotone and antimonotone parameterized problems (Q1936258) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Enumerating teams in first-order team logics (Q2172832) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- Weighted NP Optimization Problems: Logical Definability and Approximation Properties (Q4210135) (← links)