Live briefing
Everything about Parity function
Function in Boolean algebra
In Boolean algebra, a parity function is a Boolean function whose value is one if and only if the input vector has an odd number of ones. The parity function of two inputs is also known as the XOR function. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Parity functionA 5-minute orientation
- Skim a recent paper: Probing parity violation with the four-point correlation function of BOSS galaxiesInfluential work since 2022
- Pick up a classic book: Studies in global econometricsThe most-reprinted book on the subject
- Read the landmark paper: Wigner function as the expectation value of a parity operatorCited 339 times
- Go sideways: Switching lemmaA closely related topic
- Go sideways: Circuit complexityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Wigner function as the expectation value of a parity operator
Effect of age, sex and parity on anorectal function
Effect of Parity on Sexual Function
Effect of parity on periparturient neutrophil function in dairy cows
On the distribution of parity in the partition function
Distribution of parity of the partition function in arithmetic progressions
Generalization properties of modular networks: implementing the parity function
Self-conjugate vector partitions and the parity of the spt-function
🆕 Influential since 2022
Probing parity violation with the four-point correlation function of BOSS galaxies
Colliders and ghosts: Constraining inflation with the parity-odd galaxy four-point function
Gender differences in the association between parity and cognitive function: Evidence from the UK biobank
Parity-breaking galaxy 4-point function from lensing by chiral gravitational waves
Congruences modulo powers of 5 for the crank parity function
📚 Books worth reading
Studies in global econometricsHenri Theil · 1996
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Switching lemma In computational complexity theory, Håstad's switching lemma is a key tool for proving lower bounds on the size of constant-depth Boolean circuits. It…
- Circuit complexity In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according…
- Boolean circuit In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal…
- NC (complexity) Unsolved problem in computer science 𝖭𝖢=?𝖯 More unsolved problems in computer science In computational complexity theory, the class NC (for Nick's…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- TC0 In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC0 (Threshold Circuit) is the first class in…
- Bella Subbotovskaya Bella Abramovna Subbotovskaya (17 December 1937 – 23 September 1982) was a Soviet mathematician who founded the short-lived Jewish People's University…
- AC (complexity) In circuit complexity, AC is a complexity class hierarchy. Each class, ACi, consists of the languages recognized by Boolean circuits with depth O ( log…