The following pages link to Stable sets and polynomials (Q1313833):
Displaying 34 items.
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Maximum weighted induced subgraphs (Q279221) (← links)
- Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
- Clique versus independent set (Q402465) (← links)
- On the stable solution of large scale problems over the doubly nonnegative cone (Q403648) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Derivation radical subspace arrangements (Q531355) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Nowhere-zero flow polynomials (Q703684) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Low degree Nullstellensatz certificates for 3-colorability (Q907253) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- Standard complexes of matroids and lattice paths (Q2155637) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- A note on Turán's theorem (Q2279574) (← links)
- 2-colorability of \(r\)-uniform hypergraphs (Q2318778) (← links)
- Hermitian matrices with a bounded number of eigenvalues (Q2435585) (← links)
- Algebraic characterization of uniquely vertex colorable graphs (Q2477631) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Some Combinatorial Applications of Gröbner Bases (Q3014931) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- A note on the reducedness and Gröbner bases of Specht ideals (Q5038120) (← links)
- Communication Complexity of Pairs of Graph Families with Applications (Q5111227) (← links)
- INDEPENDENT SETS FROM AN ALGEBRAIC PERSPECTIVE (Q5389114) (← links)
- Invariant theoretic characterization of subdiscriminants of matrices (Q5409944) (← links)
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296) (← links)
- Complexity of Null- and Positivstellensatz proofs (Q5957910) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)