Pages that link to "Item:Q1065867"

The following pages link to Factoring multivariate polynomials over finite fields (Q1065867):

Displaying 36 items.

• Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes (Q398959) (← links)
• Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
• On the decidability of the theory of modules over the ring of algebraic integers (Q529159) (← links)
• An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm (Q645697) (← links)
• A lattice-based minimal partial realization algorithm for matrix sequences of varying length (Q662164) (← links)
• Counting curves and their projections (Q677992) (← links)
• Computational complexity of sentences over fields (Q937294) (← links)
• An empirical study of cache-oblivious polygon indecomposability testing (Q975317) (← links)
• Maximally equidistributed pseudorandom number generators via linear output transformations (Q1005192) (← links)
• Parallel methods for absolute irreducibility testing (Q1009361) (← links)
• Factoring sparse multivariate polynomials (Q1080656) (← links)
• Irreducibility of multivariate polynomials (Q1083191) (← links)
• Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
• Sentences over integral domains and their computational complexities (Q1286369) (← links)
• Computing Riemann-Roch spaces in algebraic function fields and related topics. (Q1600041) (← links)
• Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) (Q1750386) (← links)
• Uniform random number generation (Q1805480) (← links)
• Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
• Explicit isomorphisms of quaternion algebras over quadratic global fields (Q2081528) (← links)
• On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators (Q2229848) (← links)
• Genus computation of global function fields (Q2252117) (← links)
• Complexity of solving parametric polynomial systems (Q2256707) (← links)
• Factoring polynomials over global fields. II. (Q2456609) (← links)
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation (Q2482628) (← links)
• Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences (Q2483203) (← links)
• Arithmetic on superelliptic curves (Q2759108) (← links)
• List Decoding for Binary Goppa Codes (Q3005580) (← links)
• Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators (Q3081290) (← links)
• Factoring Multivariate Polynomials over Large Finite Fields (Q3478494) (← links)
• A Lattice-Based Minimal Partial Realization Algorithm (Q3600448) (← links)
• The arithmetic of certain cubic function fields (Q4433139) (← links)
• Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
• Lattice computations for random numbers (Q4942787) (← links)
• On Bivariate Polynomial Factorization over Finite Fields (Q5288235) (← links)
• The computational complexity of recognizing permutation functions (Q5917358) (← links)
• Local statistics for zeros of Artin-Schreier 𝐿-functions (Q6135829) (← links)