Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("PGCD")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 65

  • Page / 3
Export

Selection :

  • and

BIGRADIENTS AND THE EUCLID-STURM ALGORITHM.HOUSEHOLDER AS.1974; S.I.A.M. REV.; U.S.A.; DA. 1974; VOL. 16; NO 2; PP. 207-213; BIBL. 4 REF.Article

CERTIFICATION OF ALGORITHM 386 (A1)RAGLAND LC; GOOD DI.1973; COMMUNIC. A.C.M.; U.S.A.; DA. 1973; VOL. 16; NO 4; PP. 257; BIBL. 5 REF.Serial Issue

SCHNELLE BERECHNUNG VON KETTENBRUCHENTWICKLUNGEN = PROGRAMME POUR LE CALCUL RAPIDE DE LA FRACTION CONTINUESCHONHAGE A.1971; ACTA INFORMAT.; ALLEM.; DA. 1971; VOL. 1; NO 2; PP. 139-144; BIBL. 3 REF.Serial Issue

Periods in extensions of wordsHARJU, Tero; NOWOTKA, Dirk.Acta informatica. 2006, Vol 43, Num 3, pp 165-171, issn 0001-5903, 7 p.Article

A NEW LOOK AT CLASSICAL ALGORITHMS FOR POLYNOMIAL RESULTANT AND G.C.D. CALCULATION.BARNETT S.1974; S.I.AM. REV.; U.S.A.; DA. 1974; VOL. 16; NO 2; PP. 193-206; BIBL. 1 P.Article

COMPARISON OF ALGORITHMS FOR CALCULATION OF G.C.D. OF POLYNOMIALSPACE IS; BARNETT S.1973; INTERNATION. J. SYST. SCI.; G.B.; DA. 1973; VOL. 4; NO 2; PP. 211-226; BIBL. 16 REF.Serial Issue

A note on the Wolovich method of extraction of a greatest common divisor of two polynomial matricesSOLAK, M. K.IEEE transactions on automatic control. 1985, Vol 30, Num 10, pp 1032-1033, issn 0018-9286Article

THE COMPUTING TIME OF THE EUCLIDENA ALGORITHM.COLLINS GE.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 1; PP. 1-10; BIBL. 12 REF.Article

ALGORITHME EXPLICITE POUR LA RECHERCHE DU P.G.C.D. DANS CERTAINS ANNEAUX PRINCIPAUX D'ENTIERS DE CORPS DE NOMBRESBOUGAUT B.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 2; PP. 207-220; ABS. ENG; BIBL. 4 REF.Article

Efficient checkers for number-theoretic computationsADLEMAN, L. M; MING-DEH HUANG; KOMPELLA, K et al.Information and computation (Print). 1995, Vol 121, Num 1, pp 93-102, issn 0890-5401Article

Improvements of the power-series coefficient polynomial remainder sequence GCD algorithmSUZUKI, M.Japan journal of industrial and applied mathematics. 1993, Vol 10, Num 1, pp 41-67, issn 0916-7005Article

Calcul sur les grands nombres et VLSI: application au PGCD, au PGCD étendu et à la distance euclidienne = Very large integer arithmetic in VLSI and its application to the GCD, entended GCD and Euclidean distance algorithmsBouraoui, Rachid; Guyot, Alain.1993, 180 p.Thesis

Higher-dimensional GCD matricesHAUKKANEN, P.Linear algebra and its applications. 1992, Vol 170, pp 53-63, issn 0024-3795Article

On GCD and LCM matricesBOURQUE, K; LIGH, S.Linear algebra and its applications. 1992, Vol 174, pp 65-74, issn 0024-3795Article

A lower bound for integer greatest common divisor computationsYISHAY MANSOUR; BARUCH SCHIEBER; PRASOON TIWARI et al.Journal of the Association for Computing Machinery. 1991, Vol 38, Num 2, pp 453-471, issn 0004-5411, 19 p.Article

A SYSTEM THEORETIC INTERPRETATION FOR GCD EXTRACTIONSILVERMAN LM; VAN DOOREN P.1981; IEEE TRANS. AUTOMAT. CONTROL; ISSN 0018-9286; USA; DA. 1981; VOL. 26; NO 6; PP. 1273-1276; BIBL. 14 REF.Article

Une théorie des sous-résultants pour les polynômes en plusieurs variables = A subresultant theory for multivariate polynomialsGONZALEZ-VEGA, L.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1991, Vol 313, Num 13, pp 905-908, issn 0764-4442Article

An extended polynomial GCD algorithm using Hankel matricesSENDRA, J; LLOVET, J.Journal of symbolic computation. 1992, Vol 13, Num 1, pp 25-39, issn 0747-7171Article

Embedding GCD domains in Bézout domainsSHAMASH, J; SMITH, S. T.Journal of the London Mathematical Society. 1993, Vol 48, pp 15-30, issn 0024-6107, 1Article

The computation of polynomial greatest common divisors over an algebraic number fieldLANGEMYR, L; MCCALLUM, S.Journal of symbolic computation. 1989, Vol 8, Num 5, pp 429-448, issn 0747-7171Article

Systolic VLSI arrays for polynomial GCD computationBRENT, R. P.IEEE transactions on computers. 1984, Vol 33, Num 8, pp 731-736, issn 0018-9340Article

Jug measuring : Algorithms and complexitySHIEH, Min-Zheng; TSAI, Shi-Chun.Theoretical computer science. 2008, Vol 396, Num 1-3, pp 50-62, issn 0304-3975, 13 p.Article

Two efficient algorithms for the computation of ideal sums in quadratic ordersWEILERT, André.Mathematics of computation. 2006, Vol 75, Num 254, pp 941-981, issn 0025-5718, 41 p.Article

Complexity of factoring and calculating the GCD of linear ordinary differential operatorsGRIGOR'EV, D. YU.Journal of symbolic computation. 1990, Vol 10, Num 1, pp 7-37, issn 0747-7171, 31 p.Article

Three new algorithms for multivariate polynomial GCDSASAKI, T; SUZUKI, M.Journal of symbolic computation. 1992, Vol 13, Num 4, pp 395-411, issn 0747-7171Article

  • Page / 3