596 search results - page 1 / 120 » Complexity Analysis by Graph Rewriting |
FLOPS
2010
Springer
13 years 11 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
RTA
2010
Springer
13 years 8 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
RTA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
CADE
2008
Springer
13 years 6 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...