๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing Local Integral Closures

โœ Scribed by Emmanuel Hallouin


Book ID
102600846
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
409 KB
Volume
32
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis


Let A be a discrete valuation ring. We give a new approach to the round4 algorithm which permits the computation of the integral closure of A in a finite separable field extension of its field of fractions.


๐Ÿ“œ SIMILAR VOLUMES


Graded integral closures
โœ Rohrer, Fred ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 265 KB
On computing graph closures
โœ Samir Khuller ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 644 KB
A note on computing graph closures
โœ Jeremy P. Spinrad ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 153 KB

This note shows that the k-closure of a graph can be computed in time proportional to the size of the output, improving on previous O(n 3 ) algorithms.