✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Complexity Volume 1203 || Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy

✍ Scribed by Bongiovanni, Giancarlo; Bovet, Daniel Pierre; Battista, Giuseppe

Book ID: 111681219
Publisher: Springer Berlin Heidelberg
Year: 1997
Weight: 735 KB
Category: Article
ISBN: 3540683232
DOI: 10.1007/3-540-62592-5_61

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Complexity Volume 6078 || Towards a Distributed Search Engine

✍ Calamoneri, Tiziana; Diaz, Josep 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 81 KB

This Book Constitutes The Refereed Proceedings Of The 7th International Conference On Algorithms And Computation, Ciac 2010, Held In Rome, Italy, In May 2010. The 30 Revised Full Papers Presented Together With 3 Invited Papers Were Carefully Reviewed And Selected From 114 Submissions. Among The Topi

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Complexity Volume 1767 || On the Lovász Number of Certain Circulant Graphs

✍ Bongiovanni, Giancarlo; Petreschi, Rossella; Gambosi, Giorgio 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg ⚖ 308 KB

[Lecture Notes in Computer Science] Stru

[Lecture Notes in Computer Science] Structural, Syntactic, and Statistical Pattern Recognition Volume 7626 || Complexity of Computing Distances between Geometric Trees

✍ Gimel’farb, Georgy; Hancock, Edwin; Imiya, Atsushi; Kuijper, Arjan; Kudo, Mineic 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 384 KB

This volume constitutes the refereed proceedings of the Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2012) and Statistical Techniques in Pattern Recognition (SPR 2012), held in Hiroshima, Japan, in November 2012 as a satellite event of the 21st Internation

[Lecture Notes in Computer Science] Desc

[Lecture Notes in Computer Science] Descriptional Complexity of Formal Systems Volume 7386 || On Inverse Operations and Their Descriptional Complexity

✍ Kutrib, Martin; Moreira, Nelma; Reis, Rogério 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 298 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Science - Theory and Applications Volume 5675 || Concatenation of Regular Languages and Descriptional Complexity

✍ Frid, Anna; Morozov, Andrey; Rybalchenko, Andrey; Wagner, Klaus W. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 272 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 5125 || The Complexity of Boolean Formula Minimization

✍ Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólf 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 462 KB

The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully rev