"Lower Bounds for Runtime Complexity of Term Rewriting."

Florian Frohn et al. (2017)

> Home

Details and statistics

DOI: 10.1007/S10817-016-9397-X

access: closed

type: Journal Article

metadata version: 2020-09-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jar/FrohnGHAS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jar/FrohnGHAS17
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder:
Lower Bounds for Runtime Complexity of Term Rewriting. J. Autom. Reason. 59(1): 121-163 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.