596 search results - page 2 / 120 » Complexity Analysis by Graph Rewriting |
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
MKM
2009
Springer
14 years 2 months ago
2009
Springer
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
SYNASC
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CADE
2008
Springer
14 years 8 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...