Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits.

Dvir, Z., & Shpilka, A. (2007). Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits.

Type

Unclassified

Intellectual base

Unclassified

Year

2007

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Polynomial identity testing
  • … that the field, variables, degree bound, representation class, black-box or white-box access, identity criterion, randomness, error probability, and computational cost are explicit. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, 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:855c1837931c · see in the full table