Pages that link to "Item:Q4242300"
From MaRDI portal
The following pages link to Average time of computing Boolean operators (Q4242300):
Displaying 5 items.
- 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 (Q669532) (← links)
- Time-optimal short-circuit evaluation of Boolean expressions (Q1115174) (← links)
- On the average-case complexity of underdetermined functions (Q1669577) (← links)
- Bounds for the average-case complexity of monotone Boolean functions (Q1675542) (← links)
- Mean computing time of Boolean operators by programs with restricted memory (Q2403571) (← links)