✦ LIBER ✦

Complexity of Boolean algebras and their Scott rank

✍ Scribed by P. E. Alaev

Book ID: 110611843
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 925 KB
Volume: 38
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf02671732

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Boolean Circuits, Tensor Ranks, and Comm

Boolean Circuits, Tensor Ranks, and Communication Complexity

✍ Pudlák, Pavel; Rödl, Vojtech; Sgall, Jirí 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 481 KB

Saturated boolean algebras and their sto

Saturated boolean algebras and their stone spaces

✍ Alan Dow 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 1003 KB

On Boolean Algebras and their Recursive

On Boolean Algebras and their Recursive Completions

✍ E. W. Madison 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

Boolean complexity classes vs. their ari

Boolean complexity classes vs. their arithmetic analogs

✍ Anna Gál; Avi Wigderson 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 719 KB

This paper provides logspace and small circuit depth analogs of the result of Valiant and Vazirani, which is a randomized (or nonuniform) reduction from N P to its arithmetic analog 6 3 P. We show a similar randomized reduction between the Boolean classes N L and semiunbounded fan-in Boolean circuit

Shelah rank for Boolean algebras and som

Shelah rank for Boolean algebras and some application to elementary theories I

✍ Piero Mangani; Annalisa Marcja 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 495 KB

Boolean rank of upset tournament matrice

Boolean rank of upset tournament matrices

✍ David E. Brown; Scott Roy; J. Richard Lundgren; Daluss J. Siewert 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 344 KB