Cite
MLA Citation
Magali Bardet et al.. “On the complexity of the F5 Gröbner basis algorithm.” Journal of symbolic computation, vol. 70, 2015, pp. 49–70. http://access.bl.uk/ark:/81055/vdc_100042507111.0x000025
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Magali Bardet et al.. “On the complexity of the F5 Gröbner basis algorithm.” Journal of symbolic computation, vol. 70, 2015, pp. 49–70. http://access.bl.uk/ark:/81055/vdc_100042507111.0x000025