Recursion schemes and recursive programs are exponentially hard to analyze

Deterministic exponential lower time bounds are presented for analyzing recursion schemes and recursive programs. The lower bounds for recursion schemes hold for any interpretation with a nontrivial predicate, i.e. a predicate that is neither identically true nor identically false. The lower bounds...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 1986-08, Vol.15 (3), p.831-850
Hauptverfasser:	HUNT, H. B. III, ROSENKRANTZ, D. J
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Exact sciences and technology Programming languages Semantics Software Software engineering
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!