✦ LIBER ✦

Closure operations on measures of computational complexity

✍ Scribed by F. Adrianopoli; A. De Luca

Book ID: 110562115
Publisher: Springer Milan
Year: 1974
Tongue: English
Weight: 493 KB
Volume: 11
Category: Article
ISSN: 0008-0624
DOI: 10.1007/bf02575826

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An appraisal of computational complexity

An appraisal of computational complexity for operations researchers

✍ J.K. Lenstra; A.H.G. Rinnooy Kan; P. Van Emde Boas 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 959 KB

On the computational complexity of graph

On the computational complexity of graph closures

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the semigroup of closure operations

✍ S. V. Tolstosheina 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 333 KB

On computing the time complexity of tran

On computing the time complexity of transitive closure algorithms

✍ Joël Coffy 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 513 KB

On computational complexity of contextua

On computational complexity of contextual languages

✍ Lucian Ilie 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 726 KB

We consider the following restriction of internal contextual grammars, called local: in any derivation in a grammar, after applying a context, further contexts can be added only inside of or at most adjacent to the previous ones. We further consider a natural restriction of this derivation mode by r

On two nonequivalent measures of complex

On two nonequivalent measures of complexity

✍ Ramirez, D.E. 📂 Article 📅 1989 🏛 Institute of Electrical and Electronics Engineers ⚖ 352 KB