External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Mortality for 2×2 Matrices Is NP-Hard

Paul C. Bell, Mika Hirvensalo, Igor Potapov. Mortality for 2×2 Matrices Is NP-Hard. In Branislav Rovan, Vladimiro Sassone, Peter Widmayer, editors, Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings. Volume 7464 of Lecture Notes in Computer Science, pages 148-159, Springer, 2012. [doi]

Abstract

Abstract is missing.

runs on