Pages that link to "Item:Q5254181"
From MaRDI portal
The following pages link to Space-efficient Gröbner basis computation without degree bounds (Q5254181):
Displaying 5 items.
- Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\) (Q432760) (← links)
- Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
- Geometric complexity theory. V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- Complexity of Membership Problems of Different Types of Polynomial Ideals (Q4556588) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)