✦ LIBER ✦

Arithmetic theories for computational complexity problems

✍ Scribed by Steve Homer; John Reif

Book ID: 114037784
Publisher: Elsevier Science
Year: 1986
Weight: 491 KB
Volume: 69
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(86)80041-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sample Complexity for Computational Clas

Sample Complexity for Computational Classification Problems

✍ Daniil Ryabko 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 182 KB

Complexity of some arithmetic problems f

Complexity of some arithmetic problems for binary polynomials

✍ Eric Allender; Anna Bernasconi; Carsten Damm; Joachim Gathen; Michael Saks; Igor 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 334 KB

Arithmetic complexity of the predicate l

Arithmetic complexity of the predicate logics of certain complete arithmetic theories

✍ Valery Plisko 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 137 KB

It is proved in this paper that the predicate logic of each complete constructive arithmetic theory T having the existential property is T 1 -complete. In this connection, the techniques of a uniform partial truth deÿnition for intuitionistic arithmetic theories is used. The main theorem is applied

Computational Complexity of Holant Probl

Computational Complexity of Holant Problems

✍ Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 517 KB

Computational complexity of PERT problem

Computational complexity of PERT problems

✍ Jane N. Hagstrom 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 415 KB

Theories with self-application and compu

Theories with self-application and computational complexity

✍ Thomas Strahm 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 297 KB