搜索结果: 1-6 共查到“COMPLETE GRAPH”相关记录6条 . 查询时间(0.062 秒)
High Saturation Complete Graph Approach for EC Point Decomposition and ECDL Problem
ECDL problem Semaev polynomials block ciphers
font style='font-size:12px;'>
2016/7/20
One of the key questions in contemporary applied cryptography is whether there exist an efficient algorithm for solving the discrete logarithm problem in elliptic curves. The primary approach for this...
PARALLEL CHIP-FIRING ON THE COMPLETE GRAPH;DEVIL’S STAIRCASE AND POINCARE ROTATION NUMBER
PARALLEL CHIP-FIRING COMPLETE GRAPH DEVIL’S STAIRCASE POINCARE ROTATION NUMBER
font style='font-size:12px;'>
2015/8/14
We study how parallel chip-firing on the complete graph Kn changes behavior as we vary the total number of chips. Surprisingly,the activity of the system, defined as the average number of firings per ...
Exact two-point resistance, and the simple random on the complete graph minus $ N$ edges
Exact two-point resistance the simple random the complete graph minus Mathematical Physics
font style='font-size:12px;'>
2012/6/29
An analytical approach is developed to obtain the exact expressions for the two-point resistance, and the total effective resistance of the complete graph minus $N$ edges of the opposite vertices. The...
CLT for the proportion of infected incividuals for an epidemic model on a complete graph
CLT epidemic model complete graph
font style='font-size:12px;'>
2010/11/22
We prove a Central Limit Theorem for the proportion of infected individuals for an epidemic model by dealing with a discrete time system of simple random walks on a complete graph with n vertices. Ea...
Limit theorems for an epidemic model on the complete graph
Epidemic model random walk complete graph Markov chains Law of Large Numbers Central Limit Theorem
font style='font-size:12px;'>
2009/6/12
We study the following random walks system on the complete graph with n vertices.At time zero,there is a number of active and inactive particles living on the vertices.Active particles move as continu...
Random matching problems on the complete graph
graph matching expected value
font style='font-size:12px;'>
2009/3/19
The edges of the complete graph on n vertices are assigned independent exponentially distributed costs. A k-matching is a set of k edges of which no two have a vertex in common. We obtain explicit bou...