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. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Yang, Y., Zhou, S., & Guan, J. (2014). Calculating the crossing probability on the square tessellation of a connection game with random move order: The algorithm and its complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8497 LNCS, pp. 288–297). Springer Verlag. https://doi.org/10.1007/978-3-319-08016-1_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
