Pages that link to "Item:Q650840"
From MaRDI portal
The following pages link to Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840):
Displayed 8 items.
- Weak orientability of matroids and polynomial equations (Q491739) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
- A Polyhedral Characterization of Border Bases (Q5744696) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)