Pages that link to "Item:Q2263837"
From MaRDI portal
The following pages link to On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits (Q2263837):
Displaying 8 items.
- Mathematical models for intellectualization of synthesis of discrete logical control units (Q733916) (← links)
- Multiplexor method for realization of Boolean functions by circuits composed of arbitrary logical elements (Q880612) (← links)
- On a formula synthesizing method (Q1358438) (← links)
- Complexity of automata evaluating formulas (Q1382592) (← links)
- Computational bound on complexity of polynomial representations of Boolean functions (Q1943917) (← links)
- Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits (Q1946416) (← links)
- Automated Technology for Verification and Analysis (Q5394219) (← links)
- The complexity of Boolean function implementation in some classes of automaton circuits (Q5947815) (← links)