Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
On a Polytime Factorization Algorithm for Multilinear Polynomials over F2. / Emelyanov, Pavel; Ponomaryov, Denis.
Computer Algebra in Scientific Computing - 20th International Workshop, CASC 2018, Proceedings. ed. / VP Gerdt; W Koepf; WM Seiler; EV Vorozhtsov. Springer-Verlag GmbH and Co. KG, 2018. p. 164-176 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11077 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - On a Polytime Factorization Algorithm for Multilinear Polynomials over F2
AU - Emelyanov, Pavel
AU - Ponomaryov, Denis
N1 - Publisher Copyright: © 2018, Springer Nature Switzerland AG.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - In 2010, Shpilka and Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be factored in time cubic in the size of the polynomial given as a string. Later, we have rediscovered this result and provided a simple factorization algorithm based on computations over derivatives of multilinear polynomials. The algorithm has been applied to solve problems of compact representation of various combinatorial structures, including Boolean functions and relational data tables. In this paper, we describe an improvement of this factorization algorithm and report on preliminary experimental analysis.
AB - In 2010, Shpilka and Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be factored in time cubic in the size of the polynomial given as a string. Later, we have rediscovered this result and provided a simple factorization algorithm based on computations over derivatives of multilinear polynomials. The algorithm has been applied to solve problems of compact representation of various combinatorial structures, including Boolean functions and relational data tables. In this paper, we describe an improvement of this factorization algorithm and report on preliminary experimental analysis.
UR - http://www.scopus.com/inward/record.url?scp=85053994940&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-99639-4_11
DO - 10.1007/978-3-319-99639-4_11
M3 - Conference contribution
AN - SCOPUS:85053994940
SN - 9783319996387
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 164
EP - 176
BT - Computer Algebra in Scientific Computing - 20th International Workshop, CASC 2018, Proceedings
A2 - Gerdt, VP
A2 - Koepf, W
A2 - Seiler, WM
A2 - Vorozhtsov, EV
PB - Springer-Verlag GmbH and Co. KG
T2 - 20th International Workshop on Computer Algebra in Scientific Computing, CASC 2018
Y2 - 17 September 2018 through 21 September 2018
ER -
ID: 16758176