Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Algebraic normal form
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{merging from|Zhegalkin polynomial|Reed–Muller expansion|discuss=Talk:Algebraic normal form#Merge proposal|date=April 2025}} {{Short description|Boolean polynomials as sums of monomials}} {{refimprove|date=July 2013}} {{about|Boolean algebra|other uses|Normal form (disambiguation)}} In [[Boolean algebra]], the '''algebraic normal form''' ('''ANF'''), '''ring sum normal form''' ('''RSNF''' or '''RNF'''), ''[[Zhegalkin polynomial|Zhegalkin normal form]]'', or ''[[Reed–Muller expansion]]'' is a way of writing [[propositional logic]] formulas in one of three subforms: * The entire formula is purely true or false: ** <math>1</math> ** <math>0</math> * One or more variables are combined into a term by [[logical conjunction|AND]] (<math>\and</math>), then one or more terms are combined by [[exclusive or|XOR]] (<math>\oplus</math>) together into ANF. [[Negation]]s are not permitted: <math display="block"> a \oplus b \oplus \left(a \and b\right) \oplus \left(a \and b \and c\right) </math> * The previous subform with a purely true term: <math display="block"> 1 \oplus a \oplus b \oplus \left(a \and b\right) \oplus \left(a \and b \and c\right) </math> {{anchor|PPRM}}Formulas written in ANF are also known as [[Zhegalkin polynomial]]s and Positive Polarity (or Parity) [[Reed–Muller code|Reed–Muller expressions]] (PPRM).<ref name="Steinbach_2009"/>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)