Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Lower bounds for matrix product in bounded depth circuits with arbitrary gates
Ran Raz
, Amir Sphlika
Research output
:
Contribution to journal
›
Article
›
peer-review
18
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Lower bounds for matrix product in bounded depth circuits with arbitrary gates'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Superlinear
100%
Bounded-depth Circuits
100%
Matrix Product
100%
Number of Edges
80%
Arithmetic Circuits
60%
Constant Depth
60%
Finite Fields
40%
Constant-depth Circuits
40%
Constant-depth Boolean Circuits
40%
Linear Function
20%
Explicit Examples
20%
Bilinear
20%
Circuit Depth
20%
Boolean Functions
20%
Output Function
20%
Single Output
20%
Mathematics
Edge
100%
Matrix Product
100%
Matrix (Mathematics)
50%
Finite Field
50%
Linear Function
25%
Boolean Function
25%
Output Function
25%
Computer Science
Arithmetic Circuit
100%
Boolean Circuit
66%
Output Function
33%
Boolean Function
33%
Linear Function
33%