Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Proof complexity lower bounds from algebraic circuit complexity
Michael A. Forbes
, Amir Shpilka
, Iddo Tzameret
, Avi Wigderson
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Proof complexity lower bounds from algebraic circuit complexity'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Complexity Lower Bounds
100%
Ideal Proof System
100%
Proof Complexity
100%
Algebraic Circuit Complexity
100%
Circuit Classes
83%
Complexity One
33%
Algebraic Complexity
33%
Boolean Cube
33%
Sparse Polynomials
33%
Polynomial Degree
16%
Sparsity
16%
Interpolation Method
16%
Structure Theory
16%
Constant Degree
16%
Complexity Bounds
16%
Whole Family
16%
Proof System
16%
Power Sums
16%
Boolean
16%
Boolean Circuits
16%
Algebraic Circuits
16%
Low-degree Polynomials
16%
Multilinear Formulas
16%
Feasible Interpolation
16%
Read-once
16%
Hardness Vs Randomness
16%
Nullstellensatz
16%
Partial Structures
16%
Boolean Circuit Lower Bounds
16%
Algebraic Proof Systems
16%
Algebraic Branching Programs
16%
Extended Frege Proofs
16%
Subset Sum
16%
Computer Science
Proof System
100%
Circuit Complexity
100%
Proof Complexity
100%
Boolean Circuit
25%
Degree Polynomial
25%
Sparsity
12%
Research Direction
12%
Mathematics
Polynomial
100%
Boolean Cube
18%
Structure Theory
9%
Lower and upper bounds
9%
Low Degree
9%
Branching Programs
9%
Subset Sum
9%
Multiple Zero
9%
Nullstellensatz
9%