Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.math.symbolic    |    Symbolic algebra discussion    |    10,432 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 9,560 of 10,432    |
|    bursejan@gmail.com to All    |
|    Re: An example of RJF against GB for GCD    |
|    11 Jul 17 13:19:46    |
      I am working on it. Dont worry. For simplicity and       as a quick prototype the domain will be modelled       as a list of variables.              So a list of variabes [X,Y] and an input from K[X,Y,Z]       will mean K(X)(Y)[Z], and the new quorem will need       an additional parameter.              Such parameters are not needed in all the GB algorithms,       since I have stable variable ordering. This was a little       tricky, and I did it also in December 2016.              Am Dienstag, 11. Juli 2017 22:12:14 UTC+2 schrieb burs...@gmail.com:       > but I will rename it to sys_poly_reduce. And provide       > a separate algorithm R from Knuth, for the more       > classical univariate division algorithm, so that              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca