scientific article; zbMATH DE number 16653

zbMATH Open0736.68048MaRDI QIDQ3973339FDOQ3973339

Alessandro Logar, Teresa Krick

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cited In (9)

• On the bit complexity of polynomial system solving
• Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients
• Title not available (Why is that?)
• An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
• Segre-driven radicality testing
• A decision method for the integrability of differential-algebraic Pfaffian systems
• Random arithmetic formulas can be reconstructed efficiently
• On the computation of matrices of traces and radicals of ideals
• An algorithm for solving parametric linear systems

Recommendations

• The membership problem for unmixed polynomial ideals is solvable in single exponential time 👍 👎
• Some complexity results for polynomial ideals 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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