Combinatorial characterization of read-once formulae

M. Karchmer; N. Linial; I. Newman; M. Saks; A. Wigderson

doi:10.1016/0012-365X(93)90372-Z

Combinatorial characterization of read-once formulae

M. Karchmer
, N. Linial
, I. Newman^*
, M. Saks
, A. Wigderson

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

43 Scopus citations

Abstract

We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. These functions are called read-once functions. We use methods of combinatorial optimization and give, as a corollary, an alternative proof for some results of Seymour (1976, 1977).

Original language	English
Pages (from-to)	275-282
Number of pages	8
Journal	Discrete Mathematics
Volume	114
Issue number	1-3
DOIs	https://doi.org/10.1016/0012-365X(93)90372-Z
State	Published - 28 Apr 1993

Bibliographical note

Funding Information:
Correspondence to: I. Newman, Department of Mathematics and Computer Science, University of Haifa, Haifa 3 1905, Israel. *Supported in part by NSF grant DMS870354oeI and Air Force Office of Scientific Research grant AFOSR-0271.

Access to Document

10.1016/0012-365X(93)90372-Z

Cite this

@article{c64427efd4eb4508ac1819aa9879d065,

title = "Combinatorial characterization of read-once formulae",

abstract = "We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. These functions are called read-once functions. We use methods of combinatorial optimization and give, as a corollary, an alternative proof for some results of Seymour (1976, 1977).",

author = "M. Karchmer and N. Linial and I. Newman and M. Saks and A. Wigderson",

note = "Funding Information: Correspondence to: I. Newman, Department of Mathematics and Computer Science, University of Haifa, Haifa 3 1905, Israel. *Supported in part by NSF grant DMS870354oeI and Air Force Office of Scientific Research grant AFOSR-0271.",

year = "1993",

month = apr,

day = "28",

doi = "10.1016/0012-365X(93)90372-Z",

language = "אנגלית",

volume = "114",

pages = "275--282",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Combinatorial characterization of read-once formulae

AU - Karchmer, M.

AU - Linial, N.

AU - Newman, I.

AU - Saks, M.

AU - Wigderson, A.

N1 - Funding Information: Correspondence to: I. Newman, Department of Mathematics and Computer Science, University of Haifa, Haifa 3 1905, Israel. *Supported in part by NSF grant DMS870354oeI and Air Force Office of Scientific Research grant AFOSR-0271.

PY - 1993/4/28

Y1 - 1993/4/28

N2 - We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. These functions are called read-once functions. We use methods of combinatorial optimization and give, as a corollary, an alternative proof for some results of Seymour (1976, 1977).

AB - We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. These functions are called read-once functions. We use methods of combinatorial optimization and give, as a corollary, an alternative proof for some results of Seymour (1976, 1977).

UR - https://www.scopus.com/pages/publications/0003229979

U2 - 10.1016/0012-365X(93)90372-Z

DO - 10.1016/0012-365X(93)90372-Z

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0003229979

SN - 0012-365X

VL - 114

SP - 275

EP - 282

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Combinatorial characterization of read-once formulae

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this