A polynomial-time algorithm is proposed for solving LVP and CVP in p-adic fields by constructing orthogonal bases via maximal orders and p-radicals when the field is given by a minimal polynomial.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Notes on the LVP and CVP in $p$-adic Fields
A polynomial-time algorithm is proposed for solving LVP and CVP in p-adic fields by constructing orthogonal bases via maximal orders and p-radicals when the field is given by a minimal polynomial.