The following pages link to (Q3929052):
Displayed 14 items.
- Even partitions in plethysms. (Q536182) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- There are no p-complete families of symmetric Boolean functions (Q1114662) (← links)
- The complexity of partial derivatives (Q1171380) (← links)
- A note on the determinant and permanent problem (Q1263283) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices (Q5387751) (← links)