https://github.com/janverschelde/PHCpack
Tip revision: ba346bd0b129755e47ff5a143861d9e1ca43baa6 authored by Jan Verschelde on 26 March 2018, 17:35:25 UTC
added a paragraph describing the absence of Bezout numbers when multitasking is applied in the solver
added a paragraph describing the absence of Bezout numbers when multitasking is applied in the solver
Tip revision: ba346bd
ts_tree.c
#include <stdio.h>
#include "tree.h"
int main()
{
int m, p, q, sum;
printf("Give p, dimension of the solution planes :");
scanf("%d", &p);
printf("Give m, the co-dimension so that n = m+p :");
scanf("%d", &m);
printf("Give q, the degree of the maps :");
scanf("%d", &q);
if(q==0)
sum = Build_Bottom_Tree(m,p);
else
sum = Q_Build_Bottom_Tree(m,p,q);
printf("The number of roots : %d\n", sum);
return 0;
}