Pages that link to "Item:Q2820943"
From MaRDI portal
The following pages link to Complexity of implementation of parity functions in the ``implication-negation'' basis (Q2820943):
Displaying 4 items.
- Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements (Q255774) (← links)
- On the parity complexity measures of Boolean functions (Q974756) (← links)
- Order of state functions and logic functions (Q1186575) (← links)
- Complexity and structure of circuits for parity functions (Q1791765) (← links)