Pages that link to "Item:Q5301623"
From MaRDI portal
The following pages link to Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility (Q5301623):
Displaying 14 items.
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Low degree Nullstellensatz certificates for 3-colorability (Q907253) (← links)
- Combinatorial versus decision-theoretic components of impossibility theorems (Q1915820) (← links)
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (Q2401415) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants (Q4917988) (← links)
- Chordal Networks of Polynomial Ideals (Q5347294) (← links)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
- Approximating amoebas and coamoebas by sums of squares (Q5497034) (← links)
- A Polyhedral Characterization of Border Bases (Q5744696) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
- Graphs with large girth and chromatic number are hard for Nullstellensatz (Q6573006) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)