Hilbert's Nullstellensatz is in the polynomial hierarchy
From MaRDI portal
Publication:2365408
Recommendations
Cited in
(33)- Elimination of parameters in the polynomial hierarchy
- The computational complexity of some problems of linear algebra
- Skolem functions of arithmetical sentences.
- On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?
- The complexity of local dimensions for constructible sets
- Cook's versus Valiant's hypothesis
- Univariate ideal membership parameterized by rank, degree, and number of generators
- Efficient algorithms for sparse cyclotomic integer zero testing
- Linear projections of the Vandermonde polynomial
- A \(\tau \)-conjecture for Newton polygons
- Knottedness is in NP, modulo GRH
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
- Algebraic geometry over four rings and the frontier to tractability.
- On the complexity of Diophantine geometry in low dimensions (extended abstract)
- Geometric complexity theory. V: Efficient algorithms for Noether normalization
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- On the complexity of torus knot recognition
- Reductions modulo primes of systems of polynomial equations and algebraic dynamical systems
- Constraint satisfaction problems over numeric domains
- From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
- Univariate ideal membership parameterized by rank, degree, and number of generators
- scientific article; zbMATH DE number 7250150 (Why is no real title available?)
- Diophantine equations and the generalized Riemann hypothesis
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations
- Identity testing for radical expressions
- Cyclotomic identity testing and applications
- Complexity of robust orbit problems for torus actions and the abc-conjecture
- Positivity of Schubert coefficients
- Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz
- The complexity of tensor rank
- On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
This page was built for publication: Hilbert's Nullstellensatz is in the polynomial hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365408)
