Arithmetic Circuits

Shpilka, A., & Yehudayoff, A. (2010). Arithmetic Circuits: a survey of recent results and open questions. Foundations and Trends® in Theoretical Computer Science, 3-4.

Type

Journal article

Intellectual base

Primary research

Year

2010

Pages

3-4

DOI

10.1561/0400000039

DOI registrant

Emerald

Link

https://doi.org/10.1561/0400000039

Cited by

2 citations across 2 artifacts.

Domain-specific

• Arithmetic circuit complexity
  • Circuit model, coefficient field, allowed gates, size, depth, uniformity and whether divisions or constants are free must be declared.
• Polynomial identity testing
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:ad11fda1fac8 · see in the full table