Construction and estimation of bases in function fields
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4118449 (Why is no real title available?)
- scientific article; zbMATH DE number 3308501 (Why is no real title available?)
- scientific article; zbMATH DE number 3342122 (Why is no real title available?)
- Eisenstein's theorem on power series expansions of algebraic functions
- On Siegel's lemma
Cited in
(30)- Fast lattice reduction for F₂-linear pseudorandom number generators
- Lattice basis reduction algorithms and multi-dimensional continued fractions
- Polynomials with roots modulo every integer
- Effective analysis of integral points on algebraic curves
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- Higher Newton polygons and integral bases
- Computation of integral bases
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- Computation of triangular integral bases
- Genus computation of global function fields
- scientific article; zbMATH DE number 3250683 (Why is no real title available?)
- Solving genus zero Diophantine equations over number fields
- Explicit Chevalley-Weil theorem for affine plane curves
- Enumeration results on the joint linear complexity of multisequences
- scientific article; zbMATH DE number 34788 (Why is no real title available?)
- Effective estimation of integer points of a family of algebraic curves
- scientific article; zbMATH DE number 3049510 (Why is no real title available?)
- An upper bound for the number of \(S\)-integral points on curves of genus zero
- Integer points and models of algebraic curves
- Quasi-equivalence of heights in algebraic function fields of one variable
- Quantitative Chevalley-Weil theorem for curves
- 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
- The Mathematical Work of Wolfgang Schmidt
- On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
- Remarks on Eisenstein
- A lattice-based minimal partial realization algorithm for matrix sequences of varying length
- Factoring polynomials over global fields. II.
- Factoring polynomials over global fields. I
This page was built for publication: Construction and estimation of bases in function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179505)