Pages that link to "Item:Q1842774"
From MaRDI portal
The following pages link to On the complexity of planar Boolean circuits (Q1842774):
Displaying 5 items.
- 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)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
