Pages that link to "Item:Q1179505"

The following pages link to Construction and estimation of bases in function fields (Q1179505):

Displaying 28 items.

• Computation of integral bases (Q271785) (← links)
• Higher Newton polygons and integral bases (Q472859) (← links)
• On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\) (Q539903) (← links)
• Solving genus zero Diophantine equations over number fields (Q607162) (← 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)
• Lattice basis reduction algorithms and multi-dimensional continued fractions (Q958608) (← links)
• Enumeration results on the joint linear complexity of multisequences (Q998652) (← links)
• Explicit Chevalley-Weil theorem for affine plane curves (Q1011129) (← links)
• Integer points and models of algebraic curves (Q1335540) (← links)
• Effective estimation of integer points of a family of algebraic curves (Q1364299) (← links)
• Computing Riemann-Roch spaces in algebraic function fields and related topics. (Q1600041) (← links)
• Effective analysis of integral points on algebraic curves (Q1895080) (← links)
• On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators (Q2229848) (← links)
• Genus computation of global function fields (Q2252117) (← links)
• Quantitative Chevalley-Weil theorem for curves (Q2377339) (← links)
• Factoring polynomials over global fields. I (Q2456562) (← links)
• Factoring polynomials over global fields. II. (Q2456609) (← links)
• Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences (Q2483203) (← links)
• Quasi-equivalence of heights in algebraic function fields of one variable (Q2672962) (← links)
• REMARKS ON EISENSTEIN (Q2861572) (← links)
• Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators (Q3081290) (← links)
• The Mathematical Work of Wolfgang Schmidt (Q3530424) (← links)
• A Lattice-Based Minimal Partial Realization Algorithm (Q3600448) (← links)
• (Q3989561) (← links)
• Polynomials with roots modulo every integer (Q4890219) (← links)
• An upper bound for the number of $S$-integral points on curves of genus zero (Q5066085) (← links)
• Computation of triangular integral bases (Q6165856) (← links)