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