𝔖 Bobbio Scriptorium

✦ LIBER ✦

Gems of Theoretical Computer Science || The Berman-Hartmanis Conjecture and Sparse Sets

✍ Scribed by Schöning, Uwe; Pruim, Randall

Book ID: 120245047
Publisher: Springer Berlin Heidelberg
Year: 1998
Weight: 709 KB
Category: Article
ISBN: 364260322X
DOI: 10.1007/978-3-642-60322-8_16

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparse complete sets for NP: Solution of

Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis

✍ Stephen R. Mahaney 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 942 KB

Gems of Theoretical Computer Science ||

Gems of Theoretical Computer Science || Superconcentrators and the Marriage Theorem

✍ Schöning, Uwe; Pruim, Randall 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 524 KB

Gems of Theoretical Computer Science ||

Gems of Theoretical Computer Science || The BP Operator and Graph Isomorphism

✍ Schöning, Uwe; Pruim, Randall 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 775 KB

Gems of Theoretical Computer Science ||

Gems of Theoretical Computer Science || The BP-Operator and the Power of Counting Classes

✍ Schöning, Uwe; Pruim, Randall 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 893 KB

Gems of Theoretical Computer Science ||

Gems of Theoretical Computer Science || The Equivalence Problem for LOOP(1)- and LOOP(2)-Programs

✍ Schöning, Uwe; Pruim, Randall 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 994 KB

Gems of Theoretical Computer Science ||

Gems of Theoretical Computer Science || Kolmogorov Complexity, the Universal Distribution, and Worst-Case vs. Average-Case

✍ Schöning, Uwe; Pruim, Randall 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 634 KB