The following pages link to Graph-Coloring Ideals (Q2819750):
Displaying 5 items.
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- On the robust hardness of Gröbner basis computation (Q1713027) (← 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)
