Implementing the Round Four maximal order algorithm
- Author
- FORD, D1 ; LETARD, P2
[1] Concordia univ., cent. interuniv. calcul mathématique algébrique, dep. computer sci., Montréal PQ, Canada
[2] CNRS Univ. Bordeaux I, lab. algorithmique arithmétique exp., 33405 Talence, France - Source
Journal de théorie des nombres de Bordeaux. 1994, Vol 6, Num 1, pp 39-80 ; ref : 12 ref
- ISSN
- 1246-7405
- Scientific domain
- Mathematics
- Publisher
- Université de Bordeaux 1, laboratoire de mathématiques pures, Talence
- Publication country
- France
- Document type
- Article
- Language
- English
- Keyword (fr)
- Forme normale Nombre premier Polynôme Programme ordinateur Quotient Algorithme Round Four Base entière Maple Matrice Sylvester Nombre rationnel Ordre maximal Test Dedekind
- Keyword (en)
- Normal form Prime number Polynomial Computer program Quotient Rational number
- Keyword (es)
- Forma normal Número primo Polinomio Programa computador Cociente
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02C Algebra / 001A02C02 Number theory
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 3483103
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.5802/jtnb.105 
https://dx.doi.org/10.5802/jtnb.105
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.5802\/jtnb.105\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Implementing the Round Four maximal order algorithm\";s:9:\"\u0000*\u0000jtitle\";s:43:\"Journal de th\u00e9orie des nombres de Bordeaux\";s:9:\"\u0000*\u0000stitle\";s:20:\"J. th\u00e9or. nr. Bordx\";s:7:\"\u0000*\u0000date\";s:4:\"1994\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"80\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1246-7405\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"FORD\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"LETARD, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:51:\"Implementing the Round Four maximal order algorithm\";s:8:\"\u0000*\u0000place\";s:7:\"Talence\";s:6:\"\u0000*\u0000pub\";s:62:\"Universit\u00e9 de Bordeaux 1, laboratoire de math\u00e9matiques pures\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.5802\/jtnb.105\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Implementing the Round Four maximal order algorithm\";s:9:\"\u0000*\u0000jtitle\";s:43:\"Journal de th\u00e9orie des nombres de Bordeaux\";s:9:\"\u0000*\u0000stitle\";s:20:\"J. th\u00e9or. nr. Bordx\";s:7:\"\u0000*\u0000date\";s:4:\"1994\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"80\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1246-7405\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"FORD\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"LETARD, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:51:\"Implementing the Round Four maximal order algorithm\";s:8:\"\u0000*\u0000place\";s:7:\"Talence\";s:6:\"\u0000*\u0000pub\";s:62:\"Universit\u00e9 de Bordeaux 1, laboratoire de math\u00e9matiques pures\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:16:\"10.5802\/jtnb.105\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.5802\/jtnb.105\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Implementing the Round Four maximal order algorithm\";s:9:\"\u0000*\u0000jtitle\";s:43:\"Journal de th\u00e9orie des nombres de Bordeaux\";s:9:\"\u0000*\u0000stitle\";s:20:\"J. th\u00e9or. nr. Bordx\";s:7:\"\u0000*\u0000date\";s:4:\"1994\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"80\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1246-7405\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"FORD\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"LETARD, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:51:\"Implementing the Round Four maximal order algorithm\";s:8:\"\u0000*\u0000place\";s:7:\"Talence\";s:6:\"\u0000*\u0000pub\";s:62:\"Universit\u00e9 de Bordeaux 1, laboratoire de math\u00e9matiques pures\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.5802\/jtnb.105\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Implementing the Round Four maximal order algorithm\";s:9:\"\u0000*\u0000jtitle\";s:43:\"Journal de th\u00e9orie des nombres de Bordeaux\";s:9:\"\u0000*\u0000stitle\";s:20:\"J. th\u00e9or. nr. Bordx\";s:7:\"\u0000*\u0000date\";s:4:\"1994\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"80\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1246-7405\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"FORD\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"LETARD, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:51:\"Implementing the Round Four maximal order algorithm\";s:8:\"\u0000*\u0000place\";s:7:\"Talence\";s:6:\"\u0000*\u0000pub\";s:62:\"Universit\u00e9 de Bordeaux 1, laboratoire de math\u00e9matiques pures\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:16:\"10.5802\/jtnb.105\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:51:\"Implementing the Round Four maximal order algorithm\";s:9:\"\u0000*\u0000jtitle\";s:43:\"Journal de th\u00e9orie des nombres de Bordeaux\";s:9:\"\u0000*\u0000stitle\";s:20:\"J. th\u00e9or. nr. Bordx\";s:7:\"\u0000*\u0000date\";s:4:\"1994\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"80\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1246-7405\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"FORD\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"LETARD, P\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:51:\"Implementing the Round Four maximal order algorithm\";s:8:\"\u0000*\u0000place\";s:7:\"Talence\";s:6:\"\u0000*\u0000pub\";s:62:\"Universit\u00e9 de Bordeaux 1, laboratoire de math\u00e9matiques pures\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
