Publication

Factoring multivariate polynomials over finite fields

Arjen Lenstra
1983
Journal paper

Abstract

This paper describes an algorithm for the factorization of multivariate polynomials with coefficients in a finite field that is polynomial-time in the degrees of the polynomial to be factored. The algorithm makes use of a new basis reduction algorithm for lattices over a finite field.

Official source

https://infoscience.epfl.ch/record/149494?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Factoring multivariate polynomials over finite fields

Graph Chatbot

Chat with Graph Search

K3 surfaces, cyclotomic polynomials and orthogonal groups

The multivariate Serre conjecture ring

A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM

K3 surfaces, cyclotomic polynomials and orthogonal groups

A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM

The multivariate Serre conjecture ring