Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems

Rakesh Verma. Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems. Fundamenta Informaticae, 92(1-2):145-168, 2009. [doi]

Authors

Rakesh Verma

This author has not been identified. Look up 'Rakesh Verma' in Google