Pages that link to "Item:Q1114391"
From MaRDI portal
The following pages link to Feasible arithmetic computations: Valiant's hypothesis (Q1114391):
Displaying 18 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- Planar acyclic computation (Q751805) (← links)
- Improved construction for universality of determinant and permanent (Q845874) (← links)
- Permanent and determinant (Q1097929) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- On hard instances of non-commutative permanent (Q2306589) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Lower bounds for the circuit size of partially homogeneous polynomials (Q2405138) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- Improved bounds for reduction to depth 4 and depth 3 (Q2514141) (← links)
- On Hard Instances of Non-Commutative Permanent (Q2817859) (← links)
- On the Expressive Power of Read-Once Determinants (Q2947872) (← links)
- Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes (Q3088284) (← links)
- CATEGORICAL COMPLEXITY (Q3304647) (← links)
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials (Q3392951) (← links)
