From: janburse@fastmail.fm   
      
   No you didn't. I cannot compare a probabilistic   
   possibly incomplete algorithm with a complete   
   algorithm. Also we would need references to   
      
   some papers that show the complexity of   
   GB for GCD. And all these complexity measures   
   need to be comparable,   
      
   If the GB uses some ideal dunno what characteristic   
   and expresses the complexity in these terms,   
   and the other algorithm expresses it differently   
      
   how do you compare the two?   
      
   Richard Fateman schrieb:   
   > On 7/12/2017 9:02 AM, j4n bur53 wrote:   
   >> Do you have some hard facts, runtime estimates,   
   >> test cases, runtime measurements?   
   >   
   > Why should I post such things again. You ignored them 3 times already.   
   > There are more measurements in some of the papers I referenced already.   
   >   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)