An arithmetic for non-size-increasing polynomial-time computation.

Klaus Aehlig Ulrich Berger Martin Hofmann Helmut Schwichtenberg

Published in: Theor. Comput. Sci. (2004)

Keyphrases

computational complexity
special case
bounded treewidth
polynomial size
databases
real world
image processing
optimal solution
worst case
efficient computation
window size
scales linearly