"Lower Bounds for Runtime Complexity of Term Rewriting."

Florian Frohn et al. (2017)

Details and statistics

DOI: 10.1007/S10817-016-9397-X

access: closed

type: Journal Article

metadata version: 2020-09-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics