Pages that link to "Item:Q1099134"
From MaRDI portal
The following pages link to On the planar monotone computation of Boolean functions (Q1099134):
Displaying 10 items.
- Computing with planar toppling domino arrangements (Q256439) (← links)
- Planar acyclic computation (Q751805) (← links)
- Replaceability and computational equivalence for monotone boolean functions (Q798296) (← links)
- On the complexity of planar Boolean circuits (Q1842774) (← links)
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Order of power of planar circuits implementing Boolean functions (Q2629836) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits (Q4834386) (← links)
- Evaluating Monotone Circuits on Cylinders, Planes and Tori (Q5449839) (← links)