Pages that link to "Item:Q394337"
From MaRDI portal
The following pages link to Revisiting the complexity of and/or graph solution (Q394337):
Displaying 7 items.
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case (Q2151382) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
