Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research Units
Facilities
Projects
Research output
Search by expertise, name or affiliation
Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits
Zeev Dvir
, Amir Shpilka
Research output
:
Contribution to journal
›
Article
›
peer-review
94
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Algebraic Complexity
13%
Annual
20%
Arithmetic Circuits
12%
Black Box
10%
Computing
17%
Denote
5%
Deterministic Algorithm
20%
Fan
31%
Linear Function
17%
Minimal polynomial
11%
Model
3%
Multiplication
22%
Multivariate Polynomials
10%
Polynomial
14%
Polynomial Identities
100%
Polynomial time
14%
Polynomial Zeros
25%
Query
81%
Randomized Algorithms
10%
Recovery
8%
Resolve
9%
Subset
5%
Testing
58%
Theorem
3%
Zero
9%
Engineering & Materials Science
Networks (circuits)
45%
Polynomials
63%
Recovery
4%
Testing
42%