| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401630 | Journal of Symbolic Computation | 2009 | 10 Pages |
Abstract
We give a set of multidegrees that support all the numerical information for a monomial ideal that can be reverse searched and hence is parallelizable and has space complexity that is polynomial in the size of the input. Our approach uses a new definition of closed sets for simplicial complexes that may be useful in other contexts.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
