Zhegalkin polynomial
Zhegalkin (also Žegalkin, Gégalkine or Shegalkin) polynomials are a representation of functions in Boolean algebra. 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.
Boolean polynomialGegalkine normal formGegalkine polynomialGegalkine polynomial formGégalkine normal formGégalkine polynomialGégalkine polynomial formSchegalkin normal formSchegalkin polynomialSchegalkin polynomial formShegalkin normal formShegalkin polynomialShegalkin polynomial formZegalkin normal formZegalkin polynomialZegalkin polynomial formZhegalkin normal formZhegalkin polynomial formZhegalkin polynomialsŽegalkin normal formŽegalkin polynomialŽegalkin polynomial formЖега́лкин normal formЖега́лкин polynomialЖега́лкин polynomial form
Wikipage redirect
Algebraic normal formBinary decision diagramBoolean algebraBoolean algebras canonically definedBoolean functionBoolean polynomialGegalkine normal formGegalkine polynomialGegalkine polynomial formGégalkine normal formGégalkine polynomialGégalkine polynomial formIndex of logic articlesIvan Ivanovich ZhegalkinKarnaugh mapList of Boolean algebra topicsReed–Muller expansionSchegalkin normal formSchegalkin polynomialSchegalkin polynomial formShegalkin normal formShegalkin polynomialShegalkin polynomial formZegalkin normal formZegalkin polynomialZegalkin polynomial formZhegalkin normal formZhegalkin polynomial formZhegalkin polynomialsŽegalkin normal formŽegalkin polynomialŽegalkin polynomial formЖега́лкин normal formЖега́лкин polynomialЖега́лкин polynomial form
Link from a Wikipage to another Wikipage
primaryTopic
Zhegalkin polynomial
Zhegalkin (also Žegalkin, Gégalkine or Shegalkin) polynomials are a representation of functions in Boolean algebra. 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.
has abstract
Los polinomios de Zhegalkin so ...... puede reescribirse como, xyz.
@es
Zhegalkin (also Žegalkin, Géga ...... herefore be rewritten as, xyz.
@en
Полином Жегалкина — многочлен ...... к Примеры полиномов Жегалкина:
@ru
Поліном Жегалкіна — довільна ф ...... у Приклади поліному Жегалкіна:
@uk
Link from a Wikipage to an external page
Wikipage page ID
12,152,471
page length (characters) of wiki page
Wikipage revision ID
1,015,951,706
Link from a Wikipage to another Wikipage
cs1-dates
y
@en
date
March 2021
@en
group
"nb"
@en
wikiPageUsesTemplate
subject
comment
Los polinomios de Zhegalkin so ...... puede reescribirse como, xyz.
@es
Zhegalkin (also Žegalkin, Géga ...... herefore be rewritten as, xyz.
@en
Полином Жегалкина — многочлен ...... более формализованном виде как
@ru
Поліном Жегалкіна — довільна ф ...... у Приклади поліному Жегалкіна:
@uk
label
Polinomio de Zhegalkin
@es
Polinômio de Zhegalkin
@pt
Zhegalkin polynomial
@en
Полином Жегалкина
@ru
Поліном Жегалкіна
@uk