How difficult is it to solve a Thue equation?

Smart, Nigel P. (1996) How difficult is it to solve a Thue equation? In: 2nd International Symposium on Algorithmic Number Theory (ANTS-II), Talence, France. (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)

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)

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: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: P. Ogbuji
Date Deposited: 27 May 2009 08:46
Last Modified: 25 Jun 2014 08:37
Resource URI: https://kar.kent.ac.uk/id/eprint/18504 (The current URI for this page, for reference purposes)
  • Depositors only (login required):