Pages that link to "Item:Q2819750"
From MaRDI portal
The following pages link to Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases (Q2819750):
Displaying 9 items.
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks (Q1711835) (← links)
- On the robust hardness of Gröbner basis computation (Q1713027) (← links)
- Gröbner bases and graph colorings (Q1892780) (← links)
- Privacy-preserving data splitting: a combinatorial approach (Q2035465) (← links)
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach (Q2818203) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- Polynomial calculus for optimization (Q6665696) (← links)