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