Factoring multivariate polynomials over finite fields
From MaRDI portal
Publication:1065867
DOI10.1016/0022-0000(85)90016-9zbMath0577.12013OpenAlexW2006272675MaRDI QIDQ1065867
Publication date: 1985
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/149494
Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05) Polynomials over finite fields (11T06) Computer aspects of numerical algorithms (65Yxx)
Related Items
Factoring sparse multivariate polynomials, Irreducibility of multivariate polynomials, Factoring multivariate polynomials via partial differential equations, Factoring polynomials and primitive elements for special primes, Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes, Local statistics for zeros of Artin-Schreier 𝐿-functions, On Bivariate Polynomial Factorization over Finite Fields, An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm, A lattice-based minimal partial realization algorithm for matrix sequences of varying length, Factoring polynomials over global fields. II., On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators, Computational complexity of sentences over fields, List Decoding for Binary Goppa Codes, Counting curves and their projections, Row reduction applied to decoding of rank-metric and subspace codes, Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\), Genus computation of global function fields, On the decidability of the theory of modules over the ring of algebraic integers, Arithmetic on superelliptic curves, An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation, Complexity of solving parametric polynomial systems, Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences, An empirical study of cache-oblivious polygon indecomposability testing, Lattice computations for random numbers, A Lattice-Based Minimal Partial Realization Algorithm, The computational complexity of recognizing permutation functions, Factoring Multivariate Polynomials over Large Finite Fields, The arithmetic of certain cubic function fields, Maximally equidistributed pseudorandom number generators via linear output transformations, Parallel methods for absolute irreducibility testing, Uniform random number generation, Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators, Deterministic irreducibility testing of polynomials over large finite fields, Sentences over integral domains and their computational complexities, Explicit isomorphisms of quaternion algebras over quadratic global fields, Computing Riemann-Roch spaces in algebraic function fields and related topics.
Cites Work
