Pages that link to "Item:Q3552513"
From MaRDI portal
The following pages link to Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513):
Displaying 19 items.
- Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Low degree Nullstellensatz certificates for 3-colorability (Q907253) (← links)
- Ideals of graph homomorphisms (Q1950425) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- Privacy-preserving data splitting: a combinatorial approach (Q2035465) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- 2-colorability of \(r\)-uniform hypergraphs (Q2318778) (← links)
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz – Corrigendum (Q3557531) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- A Polyhedral Characterization of Border Bases (Q5744696) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
