On the Conversion of Hensel Codes to Farey Rationals
Data(s) |
01/04/1983
|
---|---|
Resumo |
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The first algorithm is based on the trial and error factorization of the weight of a Hensel code, inversion and range test. The second algorithm is deterministic and uses a pair of different p-adic systems for simultaneous computation; from the resulting weights of the two different Hensel codes of the same rational, two equivalence classes of rationals are generated using the respective primitive roots. The intersection of these two equivalence classes uniquely identifies the rational. Both the above algorithms are exponential (in time and/or space). |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/21426/1/getPDF.pdf Krishnamurthy, EV (1983) On the Conversion of Hensel Codes to Farey Rationals. In: IEEE Transactions on Computers, 32 (4). pp. 331-337. |
Publicador |
IEEE |
Relação |
http://portal.acm.org/citation.cfm?id=1310347&jmp=abstract&coll=GUIDE&dl=GUIDE&CFID=43638719&CFTOKEN=21274500#abstract http://eprints.iisc.ernet.in/21426/ |
Palavras-Chave | #Mathematics |
Tipo |
Journal Article PeerReviewed |