The following pages link to Interpolation in Valiant's theory (Q451113):
Displaying 9 items.
- VPSPACE and a transfer theorem over the complex field (Q1034531) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Dual VP classes (Q2410687) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers (Q4989322) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) (Q6542431) (← links)
