Impact
~593
people reached
- 0 posts edited
- 0 helpful flags
- 0 votes cast
Oct
13 |
comment |
Efficient algorithm for computing the integral closure of a computable domain
@Igor: See if I care... @Gerhard: 10x, but how did you get the impression that I am looking for such? anyhow, you may fix my keyboard, if we are already talking ;-) |
Oct
12 |
awarded | Editor |
Oct
12 |
revised |
Efficient algorithm for computing the integral closure of a computable domain
edited title |
Oct
12 |
comment |
Efficient algorithm for computing the integral closure of a computable domain
I believe you should ask for help in communicating with people. Maybe a colleague could assist? |
Oct
8 |
asked | Efficient algorithm for computing the integral closure of a computable domain |
Oct
6 |
awarded | Teacher |
Oct
6 |
awarded | Scholar |
Oct
6 |
accepted | Decidability of the generated order |
Oct
6 |
awarded | Student |
Oct
6 |
comment |
Decidability of the generated order
hmm, yes, I forgot to mention (actually, any field which is dense in its real closure). Are there known relativley efficient algorithmm to it (i.e is it atleast primitive recursive), maybe using SOS stuff? |
Oct
6 |
asked | Decidability of the generated order |
Oct
6 |
answered | Applications of the Ax Kochen Ershov (AKE) princicple |