Pages that link to "Item:Q1978701"
From MaRDI portal
The following pages link to Cook's versus Valiant's hypothesis (Q1978701):
Displaying 12 items.
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Dual VP classes (Q2410687) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials (Q3392951) (← links)
- Most secant varieties of tangential varieties to Veronese varieties are nondefective (Q4588219) (← links)
- Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
- No occurrence obstructions in geometric complexity theory (Q4961749) (← links)
