Parity function

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1961-2017
0519612017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
For Boolean functions f:{0,1}<sup>n</sup> -&#62; {0,1} and g:{0,1}<sup>m</sup> -&#62; {0,1}, the function composition of f and g… (More)
  • figure 1
Is this relevant?
2008
2008
The motivating problem is agnostically learning parity functions, i.e., parity with arbitrary or adversarial noise. Specifically… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In [2], Blum et al. demonstrated the first sub-exponential algorithm for learning the parity function in the presence of noise… (More)
Is this relevant?
2004
2004
We consider two well-studied problems regarding attribute efficient learning: learning decision lists and learning parity… (More)
Is this relevant?
2001
2001
The parity function is one of the most used Boolean function for testing learning algorithms because both of its simple… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
1996
1996
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner… (More)
Is this relevant?
1990
1990
On Threshold Circuits for Parity Ramamohan Paturi and Michael E. Saks* Department of Computer Science and Engineering University… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function. Introducing the… (More)
  • figure 2
  • figure 3
Is this relevant?