✦ LIBER ✦

On the shrinkage exponent for read-once formulae

✍ Scribed by Johan Håstad; Alexander Razborov; Andrew Yao

Book ID: 107948784
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 767 KB
Volume: 141
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00081-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Interpolating Arithmetic Read-Once Fo

On Interpolating Arithmetic Read-Once Formulas with Exponentiation

✍ Daoud Bshouty; Nader H Bshouty 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 330 KB

A formula is a read-once formula if each variable appears at most once in it. An arithmetic read-once formula (AROF) with exponentiation is one in which the operations are addition, substraction, multiplication, division and exponentiation to an arbitrary integer. We present a polynomial time algori

On read-once threshold formulae and thei

On read-once threshold formulae and their randomized decision tree complexity

✍ Rafi Heiman; Ilan Newman; Avi Wigderson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 865 KB

Effective formulas for the local Łojasie

Effective formulas for the local Łojasiewicz exponent

✍ Tomasz Rodak; Stanisław Spodzieja 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 French ⚖ 179 KB

Note on Kiang's formula for the critical

Note on Kiang's formula for the critical exponent δ in water

✍ J. Straub 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 132 KB

A formula for the minimal exponent of a

A formula for the minimal exponent of a three-dimensional system

✍ I. N. Sergeev 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 822 KB

Lower Bounds on the Randomized Communica

Lower Bounds on the Randomized Communication Complexity of Read-Once Functions

✍ Nikos Leonardos; Michael Saks 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 583 KB