The following pages link to Algebraic Complexity Classes (Q2821695):
Displaying 11 items.
- \textsf{VNP} = \textsf{VP} in the multilinear world (Q894473) (← links)
- On the relative power of reduction notions in arithmetic circuit complexity (Q1679901) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- On the complexity of the differential-algebraic description of analytic complexity classes (Q2314094) (← links)
- Counting complexity classes for numeric computations II (Q3580991) (← links)
- (Q5090425) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q5092484) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) (Q6542431) (← links)
- Lower bounds for the sum of small-size algebraic branching programs (Q6636102) (← links)
