✦ LIBER ✦

Combinatorial characterization of read-once formulae

✍ Scribed by M. Karchmer; N. Linial; I. Newman; M. Saks; A. Wigderson

Book ID: 103057750
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 475 KB
Volume: 114
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90372-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the shrinkage exponent for read-once

On the shrinkage exponent for read-once formulae

✍ Johan Håstad; Alexander Razborov; Andrew Yao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 767 KB

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

The Complexity of Read-Once Resolution

✍ Hans Kleine Büning; Xishun Zhao 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 140 KB

Combinatorial proofs of formulas for pow

Combinatorial proofs of formulas for power sums

✍ Carl Wagner 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 109 KB

A combinatorial proof of the Mehler form

A combinatorial proof of the Mehler formula

✍ Dominique Foata 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 467 KB