about the PSLQ algorithm
(let x=(x1,x2...xn) be a vector, there exists an integer m=(m1,m2...mn) such that m1x1+m2x2+...mnxn=0. The goal of algorithm is to try to find m)
I wonder :
1, if m can be restricted to special data. For instance: 1<x1<100, x2 is one element of (1,3,4,6,8,10).
2, How long it runs for hundreds of variables.