In Boolean algebra, a parity function is a Boolean function whose value is 1 if the input vector has odd number of ones. The parity function is notable for its role in theoretical investigation of circuit complexity of Boolean functions.
| Property | Value |
|---|
| dbpprop:abstract
|
- In Boolean algebra, a parity function is a Boolean function whose value is 1 if the input vector has odd number of ones. The parity function is notable for its role in theoretical investigation of circuit complexity of Boolean functions.
|
| rdfs:comment
|
- In Boolean algebra, a parity function is a Boolean function whose value is 1 if the input vector has odd number of ones. The parity function is notable for its role in theoretical investigation of circuit complexity of Boolean functions.
|
| rdfs:label
| |
| skos:subject
| |
| foaf:page
| |
![[RDF Data]](/statics/sw-cube.png)
