CORR
2010
Springer
13 years 8 months ago
2010
Springer
Let Q() and Q() be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, Q() Q(). The algorithm is particularly efficient if the number of i...
MOC
2000
13 years 11 months ago
2000
We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over ...
JMLR
2006
13 years 11 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
APAL
2008
13 years 11 months ago
2008
The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question i...