ConceptTheory & Algos
Polynomial degree
The exponent of the highest-degree term with a non-zero coefficient in a polynomial.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Polynomial1
Opens up
Concepts that name this one as a prerequisite.
Schwartz-Zippel lemma3Approximate degree of parity1Baur-Strassen theorem1Block sensitivity vs. sensitivity conjecture1Degree Mantra1Degree of a polynomial representing a 3CNF formula1Degree of polynomial difference1Irreducible polynomial1Matrix polynomial1Monic polynomial1Partial fractions with repeated linear factors1Polynomial division1
Lecturers
1Lectures that assume it
13The first 12 are shown.
- Communication Complexity of Equality
- Analysis of Boolean Functions: Open Problems
- Partial Fractions
- Solutions via Laplace Transform and Matrix Exponentials
- Multivariate Polynomials and the Schwartz Zippel Lemma
- Interactive Proofs: IP=PSPACE
- Instance Checking and the Permanent
- IP = PSPACE
- The Dynamical Schinzel-Zassenhaus Conjecture and the Transfinite Diameter of Trees
- Probabilistic Computation
- The Exponential Time Hypothesis: Foundations of Computational Hardness
- Algebraic Circuit Complexity
Connections
19The lectures that define it or assume it, and the concepts next to it.
Concepts5
Lectures14
- Non-Prime Fields
- Communication Complexity of Equality
- Analysis of Boolean Functions: Open Problems
- Partial Fractions
- Solutions via Laplace Transform and Matrix Exponentials
- Multivariate Polynomials and the Schwartz Zippel Lemma
Show 8 moreShow fewer
- Interactive Proofs: IP=PSPACE
- Instance Checking and the Permanent
- IP = PSPACE
- The Dynamical Schinzel-Zassenhaus Conjecture and the Transfinite Diameter of Trees
- Probabilistic Computation
- The Exponential Time Hypothesis: Foundations of Computational Hardness
- Algebraic Circuit Complexity
- Essential Hardness: Completing the Exponential Time Hypothesis Proof