On matrix powering in low dimensions
We investigate the Matrix Powering Positivity Problem, PosMatPow: given an m×m square integer matrix M, a linear function f : Z m×m → Z with integer coefficients, and a positive integer n (encoded in binary), determine whether f(Mn) ≥ 0. We show that for fixed dimensions m of 2 and 3, this problem i...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference item |
| Published: |
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
2015
|