A deterministic polynomial-time algorithm computes two-element representations of ideals in number fields under a coprimality condition on the norm and index.
In: Algorithmic Number Theory, Third International Symposium, ANTS-III
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deterministic and Efficient Ideal Arithmetic via Two-Element Representations
A deterministic polynomial-time algorithm computes two-element representations of ideals in number fields under a coprimality condition on the norm and index.