We establish linear lower bounds for the complexity of non-trivial, primitive recursive algorithms from piecewise linear given functions. The main corollary is that logtime algorithms for the greatest common divisor from such givens (such as Stein's) cannot be matched in e ciency by primitive recurs
β¦ LIBER β¦
On greatest common divisor matrices and their applications
β Scribed by B.V.Rajarama Bhat
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 990 KB
- Volume
- 158
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On primitive recursive algorithms and th
β
Yiannis N. Moschovakis
π
Article
π
2003
π
Elsevier Science
π
English
β 341 KB
A Jacobi algorithm and metric theory for
β
M.S Waterman
π
Article
π
1977
π
Elsevier Science
π
English
β 479 KB
Barnettβs Theorems About the Greatest Co
β
Gema M. Diaz-Toca; Laureano Gonzalez-Vega
π
Article
π
2002
π
Elsevier Science
π
English
β 311 KB
This article provides a new presentation of Barnett's theorems giving the degree (resp. coefficients) of the greatest common divisor of several univariate polynomials with coefficients in an integral domain by means of the rank (resp. linear dependencies of the columns) of several Bezout-like matric
Computing greatest common divisors and s
β
Gema M. Diaz-Toca; Laureano Gonzalez-Vega
π
Article
π
2006
π
Elsevier Science
π
English
β 213 KB
Transitive matrices and their applicatio
β
AndrΓ‘s Farkas; PΓ‘l RΓ³zsa; Etelka Stubnya
π
Article
π
1999
π
Elsevier Science
π
English
β 170 KB
Weighing matrices and their applications
β
Christos Koukouvinos; Jennifer Seberry
π
Article
π
1997
π
Elsevier Science
π
English
β 493 KB
Three major applications of weighing matrices are discussed. New weighing matrices and skew weighing matrices are given for many orders 4t ~ 100. We resolve the skew-weighing matrix conjecture in the affirmative for 4t <~ 88.