Procedures:
D.7.2.1 ures_solve find all roots of 0-dimensional ideal i with resultants D.7.2.2 mp_res_mat multipolynomial resultant matrix of ideal i D.7.2.3 laguerre_solve find all roots of univariate polynom p D.7.2.4 interpolate interpolate poly from evaluation points i and results j D.7.2.5 fglm_solve find roots of 0-dim. ideal using FGLM and lex_solve D.7.2.6 triangL_solve find roots using triangular system (Lazard) D.7.2.7 triangLf_solve find roots using triangular sys. (factorizing Lazard) D.7.2.8 triangM_solve find roots of given triangular system (Moeller) D.7.2.9 lex_solve find roots of reduced lexicographic standard basis D.7.2.10 triang_solve find roots of given triangular system D.7.2.11 pcheck checks if elements (numbers) of l are roots of ideal i