✦ LIBER ✦

[Lecture Notes in Computer Science] Computer Science Logic Volume 6247 || Exact Exploration and Hanging Algorithms

✍ Scribed by Dawar, Anuj; Veith, Helmut

Book ID: 111682634
Publisher: Springer Berlin Heidelberg
Year: 2010
Weight: 223 KB
Category: Article
ISBN: 3642152058
DOI: 10.1007/978-3-642-15205-4_14

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Science Logic Volume 933 || Logic programming in Tau Categories

✍ Pacholski, Leszek; Tiuryn, Jerzy 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 836 KB

Subtyping With Singleton Types / David Aspinall -- A Subtyping For The Fisher-honsell-mitchell Lambda Calculus Of Objects / Viviana Bono And Luigi Liquori -- The Girard Translation Extended With Recursion / Torben Brauner -- Decidability Of Higher-order Subtyping With Intersection Types / Adriana B.

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorics and Computer Science Volume 1120 || Contiguity orders

✍ Deza, Michel; Euler, Reinhardt; Manoussakis, Ioannis 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 690 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Science Logic Volume 1258 || Call-by-Value, call-by-name and the logic of values

✍ Dalen, Dirk; Bezem, Marc 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 770 KB

[Lecture Notes in Computer Science] Logi

[Lecture Notes in Computer Science] Logical Foundations of Computer Science Volume 1234 || Models for the logic of proofs

✍ Adian, Sergei; Nerode, Anil 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 486 KB

[Lecture Notes in Computer Science] Cons

[Lecture Notes in Computer Science] Constructivity in Computer Science Volume 613 || Constructive topology and combinatorics

✍ Myers, J. Paul; O'Donnell, Michael J. 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 288 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms — ESA 2002 Volume 2461 || Optimal Graph Exploration without Good Maps

✍ Möhring, Rolf; Raman, Rajeev 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 197 KB