Fast Parallel Computation of Polynomials Using Few Processors

L. G Valiant, S. S., Berkowitz, S., & Rackoff, C. (1983). Fast Parallel Computation of Polynomials Using Few Processors.

Type

Unclassified

Intellectual base

Unclassified

Year

1983

DOI

10.1137/0212043

Link

https://doi.org/10.1137/0212043

Cited by

1 citation across 1 artifact.

Domain-specific

• Arithmetic circuit complexity
  • … arithmetic operations and fan-in, DAG and output gate, syntactic or semantic degree, size and depth metrics, uniformity, division and constant policy and lower- or upper-bound claim are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:b566331825ce · see in the full table