Pages that link to "Item:Q1567446"
From MaRDI portal
The following pages link to Completeness and reduction in algebraic complexity theory (Q1567446):
Displaying 50 items.
- The arithmetic complexity of tensor contraction (Q290898) (← links)
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Symmetric determinantal representation of polynomials (Q417498) (← links)
- Interpolation in Valiant's theory (Q451113) (← links)
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- The stabilizer of immanants (Q551254) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- Lower bounds for the determinantal complexity of explicit low degree polynomials (Q639850) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- VPSPACE and a transfer theorem over the complex field (Q1034531) (← 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)
- Ulrich complexity (Q1679674) (← links)
- On the relative power of reduction notions in arithmetic circuit complexity (Q1679901) (← links)
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials (Q1686837) (← links)
- Complexity classes and completeness in algebraic geometry (Q1740570) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem (Q2003990) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- Ideals of spaces of degenerate matrices (Q2144235) (← links)
- On the distribution of runners on a circle (Q2198971) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- Intersection multiplicity of a sparse curve and a low-degree curve (Q2301455) (← links)
- On hard instances of non-commutative permanent (Q2306589) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- The complexity of two problems on arithmetic circuits (Q2465637) (← links)
- An explicit solution to Post's problem over the reals (Q2479313) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Improved bounds for reduction to depth 4 and depth 3 (Q2514141) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- On Hard Instances of Non-Commutative Permanent (Q2817859) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- Log-Concavity and Lower Bounds for Arithmetic Circuits (Q2946406) (← links)
- Permanent versus determinant: Not via saturations (Q2951164) (← links)
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844) (← links)
- Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes (Q3088284) (← links)
- A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
- CATEGORICAL COMPLEXITY (Q3304647) (← links)
