Jump to content

Arithmetic circuits complexity

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Yewang315 (talk | contribs) at 14:55, 23 February 2009 (←Created page with ''''Arithmetic circuits''' are circuits whose gates compute operations over a semi-ring instead of the usual Boolean connectives. The theory of arithmetic ci…'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Arithmetic circuits are circuits whose gates compute operations over a semi-ring instead of the usual Boolean connectives. The theory of arithmetic circuits, a very rich field with strong upper and lower bounds on the complexity of practical computational problems, serves as a theoretical base for computer algebra and algebraic computations in symbolic computation software packages.

Computation model

Let

Retrieved from "https://en.wikipedia.org/w/index.php?title=Arithmetic_circuits_complexity&oldid=272726713"