Pages that link to "Item:Q1791765"
From MaRDI portal
The following pages link to Complexity and structure of circuits for parity functions (Q1791765):
Displaying 6 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)
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits (Q1183575) (← links)
- Complexity of implementation of parity functions in the ``implication-negation'' basis (Q2820943) (← links)
- The complexity of symmetric functions in parity normal forms (Q3976033) (← links)
- (Q4205392) (← links)