Pages that link to "Item:Q798294"
From MaRDI portal
The following pages link to A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\) (Q798294):
Displaying 6 items.
- A Boolean function requiring 3n network size (Q794625) (← links)
- Comment on Kochol's paper ``Efficient monotone circuits for threshold functions'' (Q918706) (← links)
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
- Directed monotone contact networks for threshold functions (Q1327314) (← links)
- Better lower bounds for monotone threshold formulas (Q1356879) (← links)
- On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
