an:01698509
Zbl 1006.94035
Chashkin, A. V.
Lower bounds for the complexity of restrictions of Boolean functions
EN
Discrete Appl. Math. 114, No. 1-3, 61-93 (2001).
00080885
2001
j
94C10 68Q25 03D15
Boolean function; circuit size complexity
Given a Boolean function \(f\) and a set \(M\) of domains, the circuit size complexity of the most complicated restriction of \(f\) to some domain in \(M\) is studied. Upper and lower bounds, depending on the domain size, are established for wide classes of Boolean functions. Similar results for other complexity measures (e.g., formula size) are given.
Heribert Vollmer (W??rzburg)