Pages that link to "Item:Q1842774"
From MaRDI portal
The following pages link to On the complexity of planar Boolean circuits (Q1842774):
Displaying 12 items.
- Planar acyclic computation (Q751805) (← links)
- On the planar monotone computation of Boolean functions (Q1099134) (← links)
- Lower bounds for synchronous circuits and planar circuits (Q1114661) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Using Flexibility in P-Circuits by Boolean Relations (Q2985749) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- The complexity of Boolean networks (Q3994882) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
- An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits (Q4834386) (← links)