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).
|Number of pages||8|
|State||Published - 28 Apr 1993|
Bibliographical noteFunding 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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics