Pages that link to "Item:Q290209"
From MaRDI portal
The following pages link to Monotone real circuits are more powerful than monotone Boolean circuits (Q290209):
Displaying 7 items.
- Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- A note on monotone real circuits (Q1685020) (← links)
- The gap between monotone and non-monotone circuit complexity is exponential (Q1813126) (← links)
- Discretely ordered modules as a first-order extension of the cutting planes proof system (Q4254700) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465877) (← links)
- Combinatorics of monotone computations (Q5928586) (← links)