As a part of a student project I have implemented the program proposed by
de Moor et al to solve Pippenger's problem in a linear time. I have tried to
measure the running times using GetCPUTime. This shows a quadratic growth in
the running time when the permutation is increased.
However, if I uses the unix command time I get a constant running time.
The only refernence to GetCPUTime I have found in the bugs mailing list is
a reference in in version 2.01. According to the compiler it self we are
using version 2.1, patch level 0 on my department. I run on Sun Solaris
machine.
Does anybody know, if this GetCPUTIme was still included in version 2.1? And if
that is the case, does this account for the differences in measurements. If
not are there any other suggestions to the differences.
Thanks in advance
Best regards
Peter M?ller Neergaard
__ _
Peter M?ller Neergaard / \-' ) ,,, WWW: http://www.diku.dk/
Dept. of Computer Science | | ()|||||||[:::) students/turtle/
University of Copenhagen \__,-._) '''
E-mail: turtle @ diku.dk
``Will all these memories be lost in time, like tears in rain?''
