Jump to content

Talk:Arithmetic circuit complexity

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 14:39, 25 January 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Computing polynomials

[edit]

What does computing mean in this context - numerical evaluation? --catslash (talk) 22:08, 23 August 2017 (UTC)[reply]

Zero function and polynomial

[edit]

Article says "consider the polynomial {\displaystyle x^{2}+x;} {\displaystyle x^{2}+x;} over the field of two elements this polynomial represents the zero function, but it is not the zero polynomial. " (my Wikilinking) - How does X^2+X on that field represent the zero function, and why does it matter that it is not the zero [empty?] polynomial ? - Rod57 (talk) 18:18, 15 May 2022 (UTC)[reply]