The following pages link to (Q3364139):
Displaying 15 items.
- Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions (Q355279) (← links)
- Thresholds and expectation-thresholds of monotone properties with small minterms (Q491531) (← links)
- On the constructive characterization of threshold functions (Q548758) (← links)
- About complexity of implementing threshold functions (Q682325) (← links)
- Asymptotically minimal schemes for one sequence of Boolean functions (Q735559) (← links)
- A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\) (Q798294) (← links)
- Comment on Kochol's paper ``Efficient monotone circuits for threshold functions'' (Q918706) (← links)
- Efficient monotone circuits for threshold functions (Q1122560) (← links)
- Directed monotone contact networks for threshold functions (Q1327314) (← links)
- Complexity of monotonic functions (Q1820753) (← links)
- On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing (Q2513137) (← links)
- On nonlinear complexity of monotone realization of a family of Boolean sums (Q3758730) (← links)
- (Q4301393) (← links)
