Pages that link to "Item:Q5947815"
From MaRDI portal
The following pages link to The complexity of Boolean function implementation in some classes of automaton circuits (Q5947815):
Displaying 6 items.
- The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits (Q1848652) (← links)
- On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits (Q2263837) (← links)
- The complexity of the descriptiveness of Boolean circuits over different sets of gates (Q2464338) (← links)
- Complexity of self-correcting circuits for some sequence of Boolean functions (Q2513094) (← links)
- (Q3972115) (← links)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)