Smart, Nigel P.
(1996)
*
How difficult is it to solve a Thue equation?
*
In: Cohen, H., ed.
Algorithmic Number Theory Second International Symposium.
Lecture Notes in Computer Science
.
Springer, Berlin, Germany, pp. 363-373.
ISBN 978-3-540-61581-1.
E-ISBN 978-3-540-70632-8.
(doi:10.1007/3-540-61581-4_67)
(The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)
(KAR id:18504)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication) | |

Official URL http://dx.doi.org/10.1007/3-540-61581-4_67 |

## Abstract

Here we present an analysis of the difficulty of solving a Thue equation. This is given as a complexity estimate in terms of the size of the initial input data and also in terms of an invariant of the equation which could effect the practical solution process in a significant way.

Item Type: | Book section |
---|---|

DOI/Identification number: | 10.1007/3-540-61581-4_67 |

Uncontrolled keywords: | Polynomial Time, Prime Ideal, Algebraic Number, Diophantine Equation, Small Solution |

Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science |

Divisions: | Faculties > Sciences > School of Computing > Theoretical Computing Group |

Depositing User: | P. Ogbuji |

Date Deposited: | 27 May 2009 08:46 UTC |

Last Modified: | 31 May 2019 09:21 UTC |

Resource URI: | https://kar.kent.ac.uk/id/eprint/18504 (The current URI for this page, for reference purposes) |

- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV

- Depositors only (login required):