See algebraic normal form in All languages combined, or Wiktionary
{ "etymology_text": "\"Algebraic\" would refer to the fact that a two-element Galois field, 𝔽₂ adjoined with some variables forms a polynomial algebra, 𝔽₂[x_1,...,x_n].", "head_templates": [ { "args": { "1": "-" }, "expansion": "algebraic normal form (uncountable)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Algebra", "orig": "en:Algebra", "parents": [ "Mathematics", "Formal sciences", "Sciences", "All topics", "Fundamental" ], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Logic", "orig": "en:Logic", "parents": [ "Formal sciences", "Philosophy", "Sciences", "All topics", "Fundamental" ], "source": "w" } ], "examples": [ { "ref": "2015 September 22, Magnus Gausdal Find, Joan Boyar, “Multiplicative Complexity of Vector Valued Boolean Functions”, in arxiv.org, retrieved 2017-08-10:", "text": "It is well known that every (n,1)-function f can be written uniquely as a multilinear polynomial over #92;mathbb#123;F#125;#95;2\n#92;qquad#92;qquad#92;qquad#92;qquad#92;qquadf(x#95;1,...,x#95;n)#61;#92;sum#95;#123;X#92;subseteq#91;n#93;#125;#92;alpha#95;X#92;prod#95;#123;i#92;inX#125;x#95;i.\nThis polynomial is called the Zhegalkin polynomial or the algebraic normal form (ANF) of f.", "type": "quote" } ], "glosses": [ "ring sum normal form" ], "id": "en-algebraic_normal_form-en-noun-8XvyK7qm", "links": [ [ "algebra", "algebra" ], [ "logic", "logic" ], [ "ring sum normal form", "ring sum normal form" ] ], "raw_glosses": [ "(algebra, logic) ring sum normal form" ], "related": [ { "word": "Zhegalkin polynomial" } ], "synonyms": [ { "word": "ring sum normal form" } ], "tags": [ "uncountable" ], "topics": [ "algebra", "human-sciences", "logic", "mathematics", "philosophy", "sciences" ], "wikipedia": [ "algebraic normal form" ] } ], "word": "algebraic normal form" }
{ "etymology_text": "\"Algebraic\" would refer to the fact that a two-element Galois field, 𝔽₂ adjoined with some variables forms a polynomial algebra, 𝔽₂[x_1,...,x_n].", "head_templates": [ { "args": { "1": "-" }, "expansion": "algebraic normal form (uncountable)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "related": [ { "word": "Zhegalkin polynomial" } ], "senses": [ { "categories": [ "English entries with incorrect language header", "English lemmas", "English multiword terms", "English nouns", "English terms with quotations", "English uncountable nouns", "Pages with 1 entry", "Pages with entries", "en:Algebra", "en:Logic" ], "examples": [ { "ref": "2015 September 22, Magnus Gausdal Find, Joan Boyar, “Multiplicative Complexity of Vector Valued Boolean Functions”, in arxiv.org, retrieved 2017-08-10:", "text": "It is well known that every (n,1)-function f can be written uniquely as a multilinear polynomial over #92;mathbb#123;F#125;#95;2\n#92;qquad#92;qquad#92;qquad#92;qquad#92;qquadf(x#95;1,...,x#95;n)#61;#92;sum#95;#123;X#92;subseteq#91;n#93;#125;#92;alpha#95;X#92;prod#95;#123;i#92;inX#125;x#95;i.\nThis polynomial is called the Zhegalkin polynomial or the algebraic normal form (ANF) of f.", "type": "quote" } ], "glosses": [ "ring sum normal form" ], "links": [ [ "algebra", "algebra" ], [ "logic", "logic" ], [ "ring sum normal form", "ring sum normal form" ] ], "raw_glosses": [ "(algebra, logic) ring sum normal form" ], "tags": [ "uncountable" ], "topics": [ "algebra", "human-sciences", "logic", "mathematics", "philosophy", "sciences" ], "wikipedia": [ "algebraic normal form" ] } ], "synonyms": [ { "word": "ring sum normal form" } ], "word": "algebraic normal form" }
Download raw JSONL data for algebraic normal form meaning in English (1.7kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-01-15 from the enwiktionary dump dated 2025-01-01 using wiktextract (b941637 and 4230888). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.