On the computational complexity of cut-reduction

Klaus Aehlig Arnold Beckmann

Published in: CoRR (2007)

Keyphrases

computational complexity
complexity reduction
high computational complexity
computational load
special case
np complete
low complexity
computational cost
bit rate
search engine
graph cuts
reduction method
data reduction
computationally efficient
data sets
data analysis
digital libraries
image segmentation
real world