scientific article; zbMATH DE number 16648

zbMATH Open0747.13019MaRDI QIDQ3973334FDOQ3973334

Bhubaneswar Mishra, Giovanni Gallo

Publication date: 26 June 1992

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

zbMATH Keywords

optimal algorithmscharacteristic set of an idealparallel time complexities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Differential algebra (12H05) Ideals and multiplicative ideal theory in commutative rings (13A15)

Cited In (25)

• On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
• Title not available (Why is that?)
• Elimination theory in differential and difference algebra
• Complexity results for triangular sets
• Characteristic set algorithms for equation solving in finite fields
• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
• On the parameterization of algebraic curves
• Complexity of triangular representations of algebraic sets
• A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
• A characteristic set method for ordinary difference polynomial systems
• A Direttissimo Algorithm for Equidimensional Decomposition
• On the efficiency of solving Boolean polynomial systems with the characteristic set method
• A probabilistic algorithm to test local algebraic observability in polynomial time
• The uniform companion for large differential fields of characteristic 0
• Title not available (Why is that?)
• A generalized Euclidean algorithm for geometry theorem proving
• Computation of differential Chow forms for ordinary prime differential ideals
• Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
• Applications of differential algebra for computing Lie algebras of infinitesimal CR-automorphisms
• An alternative algorithm for computing the pseudo-remainder of multivariate polynomials
• Wu's method and the Khovanskii finiteness theorem
• An Algorithm for the Intersection Problem of Planar Parametric Curves
• Computational complexity and constraint logic programming languages
• Characteristic sets for ordinary differential equations
• A semi-algebraic approach for asymptotic stability analysis

   Recommendations

• Title not available (Why is that?) 👍 👎
• A new algorithmic scheme for computing characteristic sets 👍 👎
• A strategy for speeding-up the computation of characteristic sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets 👍 👎
• Efficient algorithms for computing the characteristic polynomial in a domain 👍 👎
• Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities 👍 👎
• Characteristic set algorithms for equation solving in finite fields 👍 👎
• Characterizations of efficient solutions under polyhedrality assumptions 👍 👎
• Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms 👍 👎

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 Q3973334)