---------------------------------------------------------------
File: index.html        author: A.Lobo      last_updated: May.19.1995
---------------------------------------------------------------
wlss2.sh.gz (126K)
	- New source code for block wiedemann [ GF(2) version ]
	- shell scripts to run locally and in distributed
	  mode.
	- Postscript man page 

	The file has to be UUDECODEd, UNCOMPRESSed and then UNSHARd	

	Sample times:

	= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = 
	N	#proc/n    Sequence      Minpoly	 Eval	    Total
	= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = 
	52250 	2/4	    0:23	  1:02		 0:08	     1:33 
	
	252222	2/4	   28:46	 23:54  	11:52	    64:32
	
	569466	2/4	  167:39	 106:45  	57:40	   332:04
	= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = 

	Timings are in hours:min for finding 128 candidate solutions.

	N refers to the dimension of the matrix, n to the blocking factor. 

	All parallel jobs were run on  2 SPARC20 machines. The first matrix
        was supplied by A. Odlyzko. The other two represent the relations 
        from the rsa120 and rsa129 integer factoring effort, and were supplied 
        by A. Lenstra.

	Please report bugs to loboa@cs.rpi.edu. To receive notification of
        bug fixes, please register (optional!) by sending an email message
        to loboa@cs.rpi.edu.


--------------------------------------------------------------