scientific article

From MaRDI portal
Publication:3360999

zbMath0734.13017MaRDI QIDQ3360999

Y. N. Lakshman

Publication date: 1991


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (26)

Gröbner bases of ideals defined by functionals with an application to ideals of projective pointsGröbner bases and cocyclic Hadamard matricesGröbner basis computation of Drazin inverses with multivariate rational function entriesComputing zero-dimensional tropical varieties via projectionsالگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسیOn the complexity exponent of polynomial system solvingComputation of real radicals of polynomial ideals. IIA factorization algorithm for \(G\)-algebras and its applicationsRigid continuation paths II. structured polynomial systemsAn FGLM-like algorithm for computing the radical of a zero-dimensional idealComputing Circuit Polynomials in the Algebraic Rigidity MatroidCondition number based complexity estimate for solving polynomial systemsSegre-driven radicality testingExact algorithms for the bottleneck Steiner tree problemOn the computation of matrices of traces and radicals of idealsComputing zero-dimensional schemesCounting and enumerating feasible rotating schedules by means of Gröbner basesA note on upper bounds for ideal-theoretic problemsCounting and Gröbner basesDeterministic normal position transformation and its applicationsOn Bézout inequalities for non-homogeneous polynomial idealsRadical computations of zero-dimensional ideals and real root counting.Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive formsComputing ideals of pointsDegröbnerization: a political manifestoOn the complexity of the \(F_5\) Gröbner basis algorithm




This page was built for publication: