✦ LIBER ✦

Problems complete for deterministic logarithmic space

✍ Scribed by Stephen A Cook; Pierre McKenzie

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 569 KB
Volume: 8
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(87)90018-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decision problems associated with comple

Decision problems associated with complete deterministic normal systems

✍ Paul Axt; W. E. Singletary 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB

A deterministic algorithm for modular kn

A deterministic algorithm for modular knapsack problems

✍ Arto Salomaa 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Limit theorems for the logarithm of samp

Limit theorems for the logarithm of sample spacings

✍ Yongzhao Shao; Marjorie G. Hahn 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Planning horizons for the deterministic

Planning horizons for the deterministic capacity problem

✍ Robert L. Smith 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 862 KB

For completeness, sublogarithmic space i

For completeness, sublogarithmic space is no space

✍ Manindra Agrawal 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 73 KB

It is shown that for any class C closed under linear-time reductions, the complete sets for C under sublogarithmic reductions are also complete under 2DFA reductions, and thus are isomorphic under first-order reductions.

Complete problems for monotone NP

✍ Iain A. Stewart 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 768 KB