搜索结果: 91-95 共查到“数学 computing”相关记录95条 . 查询时间(0.059 秒)
Computing Nash Equilibria: Approximation and Smoothed Complexity
Computing Nash Equilibria Approximation Smoothed Complexity
font style='font-size:12px;'>
2012/11/29
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria and in the smoothed anal...
The First International Conference on Numerical Algebra and Scientific Computing
Scientific Computing theoretical
font style='font-size:12px;'>
2006/8/28
NASC is an international conference organized by Chinese numerical algebra group starting from 2006. The conference highlights recent advances in theoretical, computational and practical aspects of li...
International Symposium on Distributed Computing and Applications for Business，Engineering，and Sciences
Distributed Computing Applications Business Engineering Sciences
font style='font-size:12px;'>
2006/8/23
The fifth International Conference on Distributed Computing and Applications for business, engineering and sciences(DCABES2006)will be held on 12-15 October 2006 in Hangzhou of Zhejiang Province. As i...
Computing special values of partial zeta functions
Computing special values partial zeta functions
font style='font-size:12px;'>
2010/10/29
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the \emph{Eisenstein cocycle} $\Psi $, a group cocycle for $GL_{n} (\Z...
A modular algorithm for computing greatest common right divisors of Ore polynomials
modular algorithm computing greatest common right divisors Ore polynomials
font style='font-size:12px;'>
2013/9/3
This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polynomials are used to compute the...