Pages that link to "Item:Q1936258"
From MaRDI portal
The following pages link to Completely inapproximable monotone and antimonotone parameterized problems (Q1936258):
Displaying 8 items.
- Complete problems for monotone NP (Q673092) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Complexity of minimum-size arc-inconsistency explanations (Q6154178) (← links)