107 search results - page 1 / 22 » Polynomially Bounded Matrix Interpretations |
RTA
2010
Springer
13 years 8 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
CADE
1992
Springer
13 years 8 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
ADCM
2004
13 years 4 months ago
2004
We give an algebraic interpretation of the well
APPML
2007
13 years 4 months ago
2007
In this note, we obtain a lower bound for the distance between the pseudospectrum of a matrix polynomial and a given point that lies out of it, generalizing a known result on pseu...