Towards extending Fulton's algorithm for computing intersection multiplicities beyond the bivariate case

DOI10.1007/978-3-030-85165-1_14OpenAlexW3194658714MaRDI QIDQ831986FDOQ831986

Marc Moreno Maza, Ryan Sandford

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85165-1_14

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Remarks on Divisors of Zero
• On Fulton’s Algorithm for Computing Intersection Multiplicities
• A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Bidimensionality: new connections between FPT algorithms and PTASs
• On Fulton’s Algorithm for Computing Intersection Multiplicities
• A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface

Uses Software

• SINGULAR

This page was built for publication: Towards extending Fulton's algorithm for computing intersection multiplicities beyond the bivariate case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831986)