Average time of computing Boolean operators
From MaRDI portal
Recommendations
Cites work
Cited in
(11)- Time-optimal short-circuit evaluation of Boolean expressions
- On the average-case complexity of underdetermined functions
- Bounds for the average-case complexity of monotone Boolean functions
- Generalization of cardinality estimates for plane circuits realizing partial Boolean operators
- Time of computations on linear binary graphs
- Iteration of Boolean \((n,n)\)-operators
- Mean computing time of Boolean operators by programs with restricted memory
- scientific article; zbMATH DE number 1037955 (Why is no real title available?)
- On the realization of linear Boolean operators by straight-line programs with a conditional stop
- Average case complexity for finite Boolean functions
- An upper bound of unreliability of non-branching programs in an arbitrary complete finite basis for one-type constant faults at the outputs of computational operators
This page was built for publication: Average time of computing Boolean operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242300)