The following pages link to (Q3929052):
Displaying 32 items.
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- Even partitions in plethysms. (Q536182) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- \textsf{VNP} = \textsf{VP} in the multilinear world (Q894473) (← 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)
- On the relative power of reduction notions in arithmetic circuit complexity (Q1679901) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Vanishing symmetric Kronecker coefficients (Q2181688) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- Lower bounds for the circuit size of partially homogeneous polynomials (Q2405138) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
- Permanent versus determinant: Not via saturations (Q2951164) (← links)
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
- No occurrence obstructions in geometric complexity theory (Q4961749) (← links)
- On the complexity of computing a random Boolean function over the reals (Q5140843) (← links)
- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices (Q5387751) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
- On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912) (← links)
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)
- How I got to like graph polynomials (Q6593617) (← links)
