# Functions that are read-once on a subset of their inputs

Lisa Hellerstein

Research output: Contribution to journalArticle

### Abstract

A monotone boolean function f{hook}: {0,1}v → {0,1} is read-once if f{hook} can be expressed as a boolean formula over (AND, OR, NOT) in which every variable in V appears at most once. A necessary and sufficient condition for f{hook} to be read-once was shown by V.A. Gurvich (and independently by others). In this paper we show necessary and sufficient conditions for f{hook} to be read-once on a given subset of its inputs. For Z ⊆ V, we say that f{hook} is read-once on Z if f{hook} can be expressed as a formula in which every member of Z appears at most once.

Original language English (US) 235-251 17 Discrete Applied Mathematics 46 3 https://doi.org/10.1016/0166-218X(93)90105-W Published - Oct 26 1993

### Fingerprint

Boolean functions
Set theory
Monotone Boolean Function
Necessary Conditions
Subset
Sufficient Conditions

### ASJC Scopus subject areas

• Computational Theory and Mathematics
• Applied Mathematics
• Discrete Mathematics and Combinatorics
• Theoretical Computer Science

### Cite this

Functions that are read-once on a subset of their inputs. / Hellerstein, Lisa.

In: Discrete Applied Mathematics, Vol. 46, No. 3, 26.10.1993, p. 235-251.

Research output: Contribution to journalArticle

Hellerstein, Lisa. / Functions that are read-once on a subset of their inputs. In: Discrete Applied Mathematics. 1993 ; Vol. 46, No. 3. pp. 235-251.
@article{8a6e9082cd1e487fa0aab081dafdeacc,
title = "Functions that are read-once on a subset of their inputs",
abstract = "A monotone boolean function f{hook}: {0,1}v → {0,1} is read-once if f{hook} can be expressed as a boolean formula over (AND, OR, NOT) in which every variable in V appears at most once. A necessary and sufficient condition for f{hook} to be read-once was shown by V.A. Gurvich (and independently by others). In this paper we show necessary and sufficient conditions for f{hook} to be read-once on a given subset of its inputs. For Z ⊆ V, we say that f{hook} is read-once on Z if f{hook} can be expressed as a formula in which every member of Z appears at most once.",
author = "Lisa Hellerstein",
year = "1993",
month = "10",
day = "26",
doi = "10.1016/0166-218X(93)90105-W",
language = "English (US)",
volume = "46",
pages = "235--251",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Functions that are read-once on a subset of their inputs

AU - Hellerstein, Lisa

PY - 1993/10/26

Y1 - 1993/10/26

N2 - A monotone boolean function f{hook}: {0,1}v → {0,1} is read-once if f{hook} can be expressed as a boolean formula over (AND, OR, NOT) in which every variable in V appears at most once. A necessary and sufficient condition for f{hook} to be read-once was shown by V.A. Gurvich (and independently by others). In this paper we show necessary and sufficient conditions for f{hook} to be read-once on a given subset of its inputs. For Z ⊆ V, we say that f{hook} is read-once on Z if f{hook} can be expressed as a formula in which every member of Z appears at most once.

AB - A monotone boolean function f{hook}: {0,1}v → {0,1} is read-once if f{hook} can be expressed as a boolean formula over (AND, OR, NOT) in which every variable in V appears at most once. A necessary and sufficient condition for f{hook} to be read-once was shown by V.A. Gurvich (and independently by others). In this paper we show necessary and sufficient conditions for f{hook} to be read-once on a given subset of its inputs. For Z ⊆ V, we say that f{hook} is read-once on Z if f{hook} can be expressed as a formula in which every member of Z appears at most once.

UR - http://www.scopus.com/inward/record.url?scp=43949164291&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43949164291&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(93)90105-W

DO - 10.1016/0166-218X(93)90105-W

M3 - Article

AN - SCOPUS:43949164291

VL - 46

SP - 235

EP - 251

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 3

ER -