Pages that link to "Item:Q2377493"
From MaRDI portal
The following pages link to Complexity of sequential implementation of partial Boolean functions (Q2377493):
Displaying 7 items.
- Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms (Q800318) (← links)
- Time-optimal short-circuit evaluation of Boolean expressions (Q1115174) (← links)
- Denseness of volatile and nonvolatile sequences of functions (Q1615914) (← links)
- Complexity of implementation of parity functions in the ``implication-negation'' basis (Q2820943) (← links)
- On the complexity of the evaluation of transient extensions of Boolean functions (Q2909178) (← links)
- (Q3115633) (← links)
- Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines (Q5691290) (← links)