搜索结果: 1-10 共查到“k-gcd”相关记录10条 . 查询时间(0.068 秒)
参数多项式GCD求解算法的新研究
参数多项式 GCD 欧几里得算法 高效算法
2021/8/18
最大公因子或公因式是数学中的一个非常基本的概念。计算整数最大公因子(GCD)的欧几里得算法可以说是最重要的数学算法。该算法也可直接应用于单变元多项式最大公因式(GCD)的计算。GCD的计算也是符号计算领域一个非常基本的问题。到目前为止，已有很多很成熟的计算多项式GCD的高效算法。但计算含参数的多项式GCD的算法却寥寥无几。究其原因，是因为参数多项式的GCD需要考虑所有可能的参数取值，不同的参数取值...
Probability that the k-gcd of products of positive integers is B-smooth
gcd of products of positive integers B-smooth k-gcd
2016/4/7
In 1849, Dirichlet[5] proved that the probability that two positive integers are relatively prime is 1/zeta(2). Later, it was generalized into the case that positive integers has no nontrivial kth pow...
Fully Homomorphic Encryption Based on Approximate Matrix GCD
Fully Homomorphic Encryption Approximate Matrix GCD
2012/6/14
We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption ...
Fully Homomorphic Encryption Based on Approximate Matrix GCD
Fully Homomorphic Encryption Approximate Matrix GCD Learning with Error Approximate GCD
2012/3/21
We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption ...
Fully Homomorphic Encryption Based on Approximate Matrix GCD
Fully Homomorphic Encryption Approximate Matrix GCD Learning with Error Approximate GCD
2012/3/22
We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption ...
Let f be an arithmetical function. The matrix [f(i, j)]n×n given by the value of f in greatest common divisor of (i, j), f(i, j) as its i, j entry is called the greatest common divisor (GCD...
On the $\ell_p$ Norm of GCD and Related Matrices
GCD matrix LCM matrix Smith's determinant $ell_p$ norm $O$-estimate
2008/6/27
On the $\ell_p$ Norm of GCD and Related Matrices.
On the Maximum Row and Column Sum Norm of GCD and Related Matrices
GCD matrix LCM matrix Smith's determinant Maximum row sum norm Maximum column sum norm $O$-estimate
2008/6/27
On the Maximum Row and Column Sum Norm of GCD and Related Matrices.
Banerjee-GCD与Banerjee-Bound联合数组相关性测试
程序并行化 相关性测试 Banerjee测试
2007/12/24
以BanerjeeGCD方法和BanerjeeBound方法为基础，充分考虑了两者的测试结果之间的相互影响以及程序并行化对相关性测试的要求，从而提出了一个在统一的框架下利用BanerjeeGCD方法与BanerjeeBound方法对不同的相关向量进行测试的联合数组相关性测试方法.该方法在保持执行时间效率的前提下提高了测试的精确性和结果的有效性，并且能够处理一部分非线性下标表达式的情况.