✦ LIBER ✦

Logics for complexity classes

✍ Scribed by Naidenko, V.

Book ID: 127106153
Publisher: Oxford University Press
Year: 2014
Tongue: English
Weight: 310 KB
Volume: 22
Category: Article
ISSN: 1367-0751
DOI: 10.1093/jigpal/jzu027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On static logics, dynamic logics, and co

On static logics, dynamic logics, and complexity classes

✍ D. Harel; D. Peleg 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 793 KB

Logics for Classes of Boolean Monoids

✍ Gerard Allwein; Hilmi Demir; Lee Pike 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 178 KB

From Almost Optimal Algorithms to Logics

From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem

✍ Chen, Yijia; Flum, Jörg 📂 Article 📅 2012 🏛 Association for Computing Machinery 🌐 English ⚖ 268 KB

Comparing complexity classes

✍ Ronald V. Book 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 867 KB

Complexity classes defined by time-bounded and space-bounded Turing acceptors are studied in order to learn more about the cost of deterministic simulation of nondeterministic processes and about time-space tradeoffs. Here complexity classes are compared by means of reducibilities and class-complete

Bi-immune sets for complexity classes

✍ José L. Balcázar; Uwe Schöning 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 692 KB

Promise problems complete for complexity

Promise problems complete for complexity classes

✍ Alan L. Selman 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 584 KB