𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Logspace and Logtime Leaf Languages

✍ Scribed by Birgit Jenner; Pierre McKenzie; Denis Thérien

Book ID
112252253
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
611 KB
Volume
129
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

LOGSPACE and PTIME characterized by prog
LOGSPACE and PTIME characterized by programming languages
✍ Neil D. Jones 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 180 KB

A programming approach to computability and complexity theory yields more natural deÿnitions and proofs of central results than the classical approach. Further, some new results can be obtained using this viewpoint. This paper contains new intrinsic characterizations of the wellknown complexity clas

Generic separations and leaf languages
Generic separations and leaf languages
✍ Matthias Galota; Sven Kosub; Heribert Vollmer 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract In the early nineties of the previous century, leaf languages were introduced as a means for the uniform characterization of many complexity classes, mainly in the range between P (polynomial time) and PSPACE (polynomial space). It was shown that the separability of two complexity class