The membership problem for unmixed polynomial ideals is solvable in single exponential time

Authors:
Alicia Dickenstein;Noaï Fitchas;Marc Giusti;Carmen Sessa
Affiliations:
-;-;-;-
Venue:
Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Year:
1991

Extended Hilbert irreducibility and its applications

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
An algorithm for the computation of the radical of an ideal

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Incomplete Gröbner basis as a preconditioner for polynomial systems

Journal of Computational and Applied Mathematics
Space-efficient Gröbner basis computation without degree bounds

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Polly cracker, revisited

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Software Engineering and complexity in effective Algebraic Geometry

Journal of Complexity
Dimension-dependent bounds for Gröbner bases of polynomial ideals

Journal of Symbolic Computation

Hi-index	0.00