Skip to search formSkip to main contentSkip to account menu

Parity function

Known as: Parity 
In Boolean algebra, a parity function is a Boolean function whose value is 1 if and only if the input vector has an odd number of ones. The parity… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Two-parity maximum distance separable (MDS) array codes achieve the lowest storage overhead for tolerating two erasures. In this… 
2011
2011
We describe a uniform construction for converting $\omega$-automata with arbitrary acceptance conditions (based on the notion of… 
2010
2010
We construct a functorial map from knots in thickened surfaces to classical knots. This method uses a natural generalisation of… 
2009
2009
This paper studies quantum query complexities for deciding (exactly or with probability 1.0) the parity of permutations of n… 
2006
2006
Abstract In negation-limited complexity, one considers circuits with a limited number of NOT gates, being motivated by the gap in… 
1993
1993
  • S. Devadas
  • 1993
  • Corpus ID: 1429972
An example is given of a class of functions with 2n+logn inputs that have two-level or sum-of-products representations containing… 
1988
1988
The authors present the design of self-checking sequential machines using standard memory elements, i.e. D, T, or JK flip-flops…