Keyphrases
Algebraic Branching Programs
39%
Algebraic Circuit Complexity
16%
Algebraic Circuits
37%
Any Order
16%
Black Box
13%
Boolean
16%
Branching Programs
12%
Circuit Classes
13%
Circuit Lower Bounds
13%
Codeword
9%
Complexity Lower Bounds
16%
Compressed Sensing
8%
Condenser
10%
Conjugation
8%
Covering Arrays
16%
Dimension Expanders
8%
Divisibility
8%
Geometric Complexity Theory
8%
Hitting Set
45%
Ideal Proof System
17%
Identity Testing
40%
In-Parameter-Order
8%
Linear Codes
9%
Low-depth Circuits
8%
Low-rank Matrix Recovery
8%
Multilinear
9%
Natural Proofs
8%
Noether Normalization
11%
Noncommutative
8%
Nonlinear Codes
8%
P-space
8%
Polynomial Ideals
8%
Polynomial Identity Testing
41%
Probabilistically Checkable Proofs
9%
Proof Complexity
19%
Prover
10%
Pseudorandom number Generator
9%
Quantum World
16%
Quasi-polynomial
14%
Read-once
34%
Read-once Branching Programs
8%
Seed Length
15%
Shifted Partial Derivatives
8%
Spatial Isolation
16%
Structure Theorem
8%
Tensor Low-rank
8%
Testing Algorithm
27%
White-box
11%
Zero-knowledge
20%
Zero-knowledge Protocols
8%
Mathematics
Algebraic Structure
16%
Black Box
14%
Branching Programs
45%
Building Block
16%
Central Role
16%
Circuit Model
9%
Closed Cone
8%
Condenser
10%
Constructive Proof
8%
Derandomization
12%
Diagonal
13%
Entangled State
16%
Exp
5%
Expander
8%
Hitting Set
50%
Interactive Proofs
19%
Linear Code
9%
Low Degree
16%
Lower and upper bounds
10%
Matrix (Mathematics)
21%
Nonlinear
8%
Open Question
8%
Partial Derivative
18%
Polynomial
100%
Polynomial Time
6%
Probabilistically checkable proofs
16%
Rank Tensor
8%
Tensor
16%
Testing Problem
7%
Tradeoff
6%
Wronskian
5%
