Publication date
January 2015
DOI Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)Abstract
We investigate the Matrix Powering Positivity Problem, PosMatPow: given an m X m square integer matrix M, a linear function f: Z^{m X m} -> Z with integer coefficients, and a positive integer n (encoded in binary), determine whether f(M^n) geq 0. We show that for fixed dimensions m of 2 and 3, this problem is decidable in polynomial time
Add to ORKG