EUVIMEDEUVIMED entdecken
Crossref

Complexity Bounds for the Generalization of Fulton's Intersection Multiplicity Algorithm

Ryan Sandford

ACM Communications in Computer Algebra · 01.12.2025 · 59 (4) · 112-115

DOI: 10.1145/3832046.3832057 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Communications in Computer Algebra, online erschienen am 18.08.2026. Verfasst von Ryan Sandford. Die Arbeit nennt 8 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We analyze the Generalization of Fulton's Intersection Multiplicity Algorithm, a symbolic partial algorithm for computing intersection multiplicities via recursive algebraic rewriting. While preliminary benchmarks suggest it may perform well on certain inputs, we show the algorithm exhibits non-elementary worst-case complexity on dense systems and exponential complexity in favorable cases. These results indicate the algorithm's practical utility is confined to systems that are either sparse or of modest size. To address this, we propose an optimization that reduces the depth of recursion across branches of computation, limiting the growth responsible for non-elementary complexity.

Zitieren

APA

Sandford, R. (2025). Complexity Bounds for the Generalization of Fulton's Intersection Multiplicity Algorithm. ACM Communications in Computer Algebra, 59(4), 112-115. https://doi.org/10.1145/3832046.3832057

Vancouver

Sandford R. Complexity Bounds for the Generalization of Fulton's Intersection Multiplicity Algorithm. ACM Communications in Computer Algebra. 2025;59(4):112-115. doi:10.1145/3832046.3832057

BibTeX
@article{Sandford2025,
  author = {Sandford, Ryan},
  title = {Complexity Bounds for the Generalization of Fulton's Intersection Multiplicity Algorithm},
  journal = {ACM Communications in Computer Algebra},
  year = {2025},
  volume = {59},
  number = {4},
  pages = {112--115},
  doi = {10.1145/3832046.3832057}
}
Kostenlos starten →