搜索结果: 1-5 共查到“计算数学 COUNTING”相关记录5条 . 查询时间(0.056 秒)
Counting good truth assignments of random k-SAT formulae
Random k-SAT Correlation Decay Uniqueness Gibbs Distribution
2015/8/21
We present a deterministic approximation algorithm to compute logarithm of the number of ‘good’ truth assignments for a random k-satisfiability (k-SAT) formula in polynomial time (by ‘good’ we m...
Counting the World's Poor: Problems and Possible Solutions
Counting the World's Poor Problems Possible Solutions
2014/3/24
Counting the World's Poor: Problems and Possible Solutions。
Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Parameterized MultilinearConvolution
2012/12/3
We present new algorithms for exact multilinear k-monomial counting which is to compute the sum of coefficients of all degree-k multilinear monomials in a given polynomial P over a ring R described by...
Counting Unique-Sink Orientations
unique-sink orientation linear complementarity problem pivoting Pmatrix
2011/1/19
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear complementarity problem. W...
Counting Method for Multi-party Computation over Non-abelian Groups
Multiparty Passive Adversary Non-Abelian Groups Graph Coloring Neighbor-Avoiding Walk Random Walk
2012/12/3
In the Crypto’07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. The function to be computed is fG(x1, . . . , xn) := x1 · . . . · xn whe...