Pages that link to "Item:Q2365408"
From MaRDI portal
The following pages link to Hilbert's Nullstellensatz is in the polynomial hierarchy (Q2365408):
Displaying 25 items.
- The complexity of tensor rank (Q722207) (← links)
- Elimination of parameters in the polynomial hierarchy (Q1285590) (← links)
- The computational complexity of some problems of linear algebra (Q1307698) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- The complexity of local dimensions for constructible sets (Q1977150) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- Efficient algorithms for sparse cyclotomic integer zero testing (Q2268346) (← links)
- Linear projections of the Vandermonde polynomial (Q2330107) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- Knottedness is in NP, modulo GRH (Q2445896) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- On the complexity of torus knot recognition (Q3120516) (← links)
- Reductions modulo primes of systems of polynomial equations and algebraic dynamical systems (Q4561832) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
- (Q5090939) (← links)
- (Q5121898) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
- Identity testing for radical expressions (Q6649437) (← links)
- Cyclotomic identity testing and applications (Q6666517) (← links)