نتایج جستجو برای: generalized gcd domain

تعداد نتایج: 566578  

2009
Suling Yang

Richard Zippel’s sparse modular GCD algorithm is widely used to compute the monic greatest common divisor (GCD) of two multivariate polynomials over Z. In this report, we present how this algorithm can be modified to solve the GCD problem for polynomials over finite fields of small cardinality. When the GCD is not monic, Zippel’s algorithm cannot be applied unless the normalization problem is r...

2007
ARIANE M. MASUDA MICHAEL E. ZIEVE

We prove that if xm + axn permutes the prime field Fp, where m > n > 0 and a ∈ Fp, then gcd(m − n, p − 1) > √ p − 1. Conversely, we prove that if q ≥ 4 and m > n > 0 are fixed and satisfy gcd(m − n, q − 1) > 2q(log log q)/ log q, then there exist permutation binomials over Fq of the form xm + axn if and only if gcd(m,n, q − 1) = 1.

1984
Ravi Kannan Gary L. Miller Larry Rudolph

The atdvent of practical parallel processors has caused a reexamination of many existing algorithms with'the hope of discovering a parallel implementation. One of the oldest and best know algorithms is Euclid's algorithm for computing the greatest common divisor (GCD). In this paper we present a parallel algorithm to compute the GCD of two integers. Although there have been results in the paral...

Journal: :J. Discrete Algorithms 2008
Sidi Mohamed Sedjelmaci

A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O (n/ logn) time using at most n1+ processors on CRCW PRAM. Sorenson and Chor and Goldreich both use a modular approach which consider the least significant bits. By contrast, our algorithm only deals with the leading bit...

1994
Dorit S. Hochbaum Walter A. Haas Anu Pathria

We demonstrate that the answer to the question posed in the title is “yes” and “no”: “no” if the set of permissible operations is restricted to {+,−,×,/,mod,<}; “yes” if we are also allowed a gcd-oracle as a permissible operation. It has been shown (see [Sto76, MST91]) that no strongly polynomial algorithm exists for the problem of finding the greatest common divisor (gcd) of two arbitrary inte...

2008
Anton Betten Anne Delandtsheer Maska Law Alice C. Niemeyer Cheryl E. Praeger Shenglin Zhou

In 1991, Weidong Fang and Huiling Li proved that there are only finitely many non-trivial linear spaces that admit a line-transitive, point imprimitive group action, for a given value of gcd(k, r), where k is the line size and r is the number of lines on a point. The aim of this paper is to make that result effective. We obtain a classification of all linear spaces with this property having gcd...

2006
Erich Kaltofen Zhengfeng Yang Lihong Zhi

The task of determining the approximate greatest common divisor (GCD) of univariate polynomials with inexact coefficients can be formulated as computing for a given Sylvester matrix a new Sylvester matrix of lower rank whose entries are near the corresponding entries of that input matrix. We solve the approximate GCD problem by a new method based on structured total least norm (STLN) algorithms...

Journal: :Journal of neuropathology and experimental neurology 2005
Maria Thom Lillian Martinian Gareth Williams Kai Stoeber Sanjay M Sisodiya

Granule cell dispersion (GCD) is observed in approximately 40% of cases of hippocampal sclerosis (HS) in patients with epilepsy. Studies in animal models suggest that GCD may be a consequence of enhanced proliferation of granule cell precursors as a result of seizures. We quantified the number of cells in cycle in subfields of the hippocampus with immunohistochemistry for Mcm2 in 14 HS cases wi...

Journal: :فیزیک زمین و فضا 0
اردلان خزائی فر دانشجوی کارشناسی ارشد، دانشکدة معدن، نفت و ژئوفیزیک، دانشگاه صنعتی شاهرود، ایران علی نجاتی کلاته استادیار، دانشکدة معدن، نفت و ژئوفیزیک، دانشگاه صنعتی شاهرود، ایران امین روشندل کاهو استادیار، دانشکدة معدن، نفت و ژئوفیزیک، دانشگاه صنعتی شاهرود، ایران فرامرز الله وردی میگونی کارشناس ژئوفیزیک، مدیریت اکتشاف، سازمان زمین شناسی و اکتشافات معدنی کشور، تهران، ایران

there are various approaches for depth estimation of anomalous potential field data. spectral analysis of gravity and magnetic data has been used extensively for many years to derive the depth to certain geological structures, such as the magnetic basement or the curie temperature isotherm. the interpretation of the gravity and magnetic data is preferred in frequency domain because of simple re...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید