The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis.

Heribert Vollmer The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. 82-90 2009 44 Theory Comput. Syst. 1 http://dx.doi.org/10.1007/s00224-007-9030-9 db/journals/mst/mst44.html#Vollmer09