论文信息 - Order-theoretic Approaches to Computational Complexity { Towards more natural characterisations - 字舞流文

Order-theoretic Approaches to Computational Complexity { Towards more natural characterisations

[1] Georg Moser,et al. A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) , 2010, RTA.

[2] Georg Moser,et al. Complexity Analysis by Rewriting , 2008, FLOPS.

[3] Georg Moser,et al. A New Order-Theoretic Characterisation of the Polytime Computable Functions , 2012, APLAS.