Name
Title | ||
|---|---|---|
Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity. |
Abstract | ||
|---|---|---|
This paper presents an algorithm for calculating the crossing probability on the square tessellation of a connection game with random move order. The time complexity of the algorithm is O(poly(N). 2.7459...(N)), where N is the size of the tessellation. We conjecture that the bound is tight within a poly(N) term. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-08016-1_26 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Dynamic programming,Discrete mathematics,Combinatorics,Square tiling,Algorithm,Tessellation,Time complexity,Conjecture,Mathematics | Conference | 8497 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.39 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Yang | 1 | 43 | 6.50 |
| Shuigeng Zhou | 2 | 2089 | 207.00 |
| Jihong Guan | 3 | 657 | 81.13 |