An efficient sparse adaptation of the polytope method over <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math> and a record-high binary bivariate factorisation-Reference-Cited by-同舟云学术

An efficient sparse adaptation of the polytope method over Fp and a record-high binary bivariate factorisation

Published:2008-05 Issue:5 Volume:43 Page:311-341
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Abu Salem Fatima K.

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference27 articles.

1. Abu-Salem, F., 2004. Parallel absolute irreducibility testing via polytopes. Tech. Rep. PRG-RR-04-14, Oxford University Computing Laboratory

2. Abu-Salem, F., Gao, S., Lauder, A., 2004. Factoring polynomials via polytopes. In: Proc. ISSAC’04. pp. 4–11

3. Abu-Salem, F.K., 2004. Factorisation Algorithms for Univariate and Bivariate Polynomials over Finite Fields. Ph.D. Thesis, Oxford University Computing Laboratory

4. The Design and Analysis of Computer Algorithms;Aho,1974

5. Bernardin, L., 1999. Factoring Multivariate Polynomials over a Finite Field. Ph.D. Thesis, ETH Zurich

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cache oblivious sparse polynomial factoring using the funnel heap;Proceedings of the 2015 International Workshop on Parallel Symbolic Computation;2015-07-10

2. Exact bivariate polynomial factorization over ℚ by approximation of roots;Journal of Systems Science and Complexity;2014-08-28

3. Sparse bivariate polynomial factorization;Science China Mathematics;2014-06-26

4. Factoring Sparse Bivariate Polynomials Using the Priority Queue;Computer Algebra in Scientific Computing;2014

5. Cryptography;Handbook of Finite Fields;2013-06-17