The following pages link to (Q4227325):
Displaying 6 items.
- Noether normalization guided by monomial cone decompositions (Q840706) (← links)
- On the robust hardness of Gröbner basis computation (Q1713027) (← links)
- Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
- Explicit construction of computational bases for \(\mathrm{RT}_k\) and \(\mathrm{BDM}_k\) spaces in \(\mathbb R^3\) (Q2401992) (← links)
- Complexity of Membership Problems of Different Types of Polynomial Ideals (Q4556588) (← links)
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups (Q5928894) (← links)
