Number of the records: 1  

Winning concurrent reachability games requires doubly-exponential patience

  1. 1.
    Hansen, K.A., Koucký, M., Miltersen, P.B. Winning concurrent reachability games requires doubly-exponential patience. In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LISC 2009. Los Angeles: IEEE Computer Society, 2009, s. 332-341. ISBN 978-0-7695-3746-7. ISSN 1043-6871.
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.