"Constant runtime complexity of term rewriting is semi-decidable."

Florian Frohn, Jürgen Giesl (2018)

Details and statistics

DOI: 10.1016/J.IPL.2018.06.012

access: closed

type: Journal Article

metadata version: 2025-01-19

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.

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy