Pages that link to "Item:Q2867092"
From MaRDI portal
The following pages link to Upper Bounds on Boolean-Width with Applications to Exact Algorithms (Q2867092):
Displaying 7 items.
- The graph formulation of the union-closed sets conjecture (Q458600) (← links)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
- Stability for maximal independent sets (Q2309229) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds (Q5096958) (← links)
- Practical algorithms for linear Boolean-width (Q5363774) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909) (← links)