A monotone Boolean (\lor,\land) circuit F computing a Boolean function f is a read-k circuit if the polynomial produced (purely syntactically) by the arithmetic (+,\times) version of F has the property that for every prime implicant of f, the polynomial contains a monomial with the same set of variables, each ... more >>>