• Zhegalkin (also Žegalkin, Gégalkine or Shegalkin) polynomials (Russian: полиномы Жегалкина), also known as algebraic normal form, are a representation...
    33 KB (5,153 words) - 14:47, 4 July 2024
  • y} . Using Zhegalkin Algebra, any perfect disjunctive normal form can be uniquely converted into a Zhegalkin polynomial (via the Zhegalkin Theorem). x...
    3 KB (417 words) - 20:22, 6 July 2024
  • interpolation, using multivariate polynomials with two or three variables Zhegalkin polynomial, a multilinear polynomial over F 2 {\displaystyle \mathbb...
    7 KB (1,241 words) - 02:26, 23 February 2023
  • Thumbnail for Boolean function
    which uniquely identifies the function: Algebraic normal form or Zhegalkin polynomial, as a XOR of ANDs of the arguments (no complements allowed) Full...
    23 KB (2,887 words) - 18:33, 15 April 2024
  • Thumbnail for Exclusive or
    &r=p+q{\pmod {2}}\\\end{matrix}}} The description of a Boolean function as a polynomial in F 2 {\displaystyle \mathbb {F} _{2}} , using this basis, is called...
    31 KB (3,346 words) - 00:37, 8 August 2024
  • Thumbnail for Logical conjunction
    Disjunctive x y {\displaystyle xy} Conjunctive x y {\displaystyle xy} Zhegalkin polynomial x y {\displaystyle xy} Post's lattices 0-preserving yes 1-preserving...
    17 KB (1,339 words) - 21:18, 11 July 2024
  • Thumbnail for Sheffer stroke
    Conjunctive x ¯ + y ¯ {\displaystyle {\overline {x}}+{\overline {y}}} Zhegalkin polynomial 1 ⊕ x y {\displaystyle 1\oplus xy} Post's lattices 0-preserving no...
    17 KB (1,384 words) - 00:53, 20 April 2024
  • sufficient operator Symmetric Boolean function Symmetric difference Zhegalkin polynomial Boolean domain Complete Boolean algebra Interior algebra Two-element...
    6 KB (271 words) - 23:18, 23 July 2024
  • Thumbnail for Logical NOR
    Conjunctive x ¯ ⋅ y ¯ {\displaystyle {\overline {x}}\cdot {\overline {y}}} Zhegalkin polynomial 1 ⊕ x ⊕ y ⊕ x y {\displaystyle 1\oplus x\oplus y\oplus xy} Post's...
    15 KB (1,158 words) - 19:29, 17 April 2024
  • \left(a\land b\land c\right)} Formulas written in ANF are also known as Zhegalkin polynomials and Positive Polarity (or Parity) Reed–Muller expressions (PPRM)...
    8 KB (1,098 words) - 17:35, 15 April 2024