Metraipolis › archive › dc_fb77ed2d598c

Algebraic normal form — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Algebraic_normal_form
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-08T10:29:35.522Z
SHA-256 of the archived text
3162a8b3b11240f7b1d32702d1deeb232fc66d15cbc7e4154351232b72edd30f
Stable URL of this page
https://metraipolis.com/documento/dc_fb77ed2d598c

How to cite

Algebraic normal form — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Algebraic_normal_form (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_fb77ed2d598c (Metraipolis archive dc_fb77ed2d598c, sha256 3162a8b3b11240f7b1d32702d1deeb232fc66d15cbc7e4154351232b72edd30f)
BibTeX
@misc{dcfb77ed2d598c,
  title = {Algebraic normal form — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Algebraic_normal_form},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_fb77ed2d598c; sha256 3162a8b3b11240f7b1d32702d1deeb232fc66d15cbc7e4154351232b72edd30f},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Algebraic_normal_form. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Algebraic normal form (ANF) is a representation of functions in boolean algebra. Formulas written in ANF are also known as ring sum normal form (RSNF or RNF), Zhegalkin polynomials (Russian: полиномы Жегалкина), or Positive Polarity (or parity) Reed–Muller expansions (PPRM). These terms describe a way of writing propositional logic formulas in one of three sub-forms: The entire formula is purely true or false: 1 0 One or more variables are combined into a term by AND (∧), then one or more terms are combined by XOR (⊕) together into ANF. Negations are not permitted: a⊕b⊕(a∧b)⊕(a∧b∧c) The previous subform with a purely true term: 1⊕a⊕b⊕(a∧b)⊕(a∧b∧c) Introduced by the Russian mathematician Ivan Ivanovich Zhegalkin in 1927, they are the polynomial ring over the integers modulo 2. The resulting degeneracies of modular arithmetic result in Zhegalkin polynomials being simpler than ordinary polynomials, requiring neither coefficients nor exponents. Coefficients are redundant because 1 is the only nonzero coefficient. Exponents are redundant because in arithmetic mod 2, x2 = x. Hence a polynomial such as 3x2y5z is congruent to, and can therefore be rewritten as, xyz.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Algebraic normal form» — https://en.wikipedia.org/wiki/Algebraic_normal_form
Wikidata Q2154043: «algebraic normal form, closely related to Zhegalkin polynomial» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2154043
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Algebraic_normal_form?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1380399720, consultata il 2026-11-08T10:25:18.986Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: bb96a9a952896738617b445de7e58728c6e829fb8901842b359d7d2ef04c2358