Symmetric and Threshold Boolean Functions Are Exhaustive. Moret, B. M. E., Thomason, M. G., & Gonzalez, R. C. IEEE Trans. Computers, 32(12):1211-1212, 1983.
Symmetric and Threshold Boolean Functions Are Exhaustive. [link]Link  Symmetric and Threshold Boolean Functions Are Exhaustive. [link]Paper  bibtex   
@article{journals/tc/MoretTG83,
  added-at = {2015-12-22T00:00:00.000+0100},
  author = {Moret, Bernard M. E. and Thomason, Michael G. and Gonzalez, Rafael C.},
  biburl = {http://www.bibsonomy.org/bibtex/22488c1265a4ad5b131f1e7ccc5efe2f4/dblp},
  ee = {http://doi.ieeecomputersociety.org/10.1109/TC.1983.1676189},
  interhash = {1ef440e94b0f0e7312da110a0c2fbab1},
  intrahash = {2488c1265a4ad5b131f1e7ccc5efe2f4},
  journal = {IEEE Trans. Computers},
  keywords = {dblp},
  number = 12,
  pages = {1211-1212},
  timestamp = {2015-12-24T11:51:55.000+0100},
  title = {Symmetric and Threshold Boolean Functions Are Exhaustive.},
  url = {http://dblp.uni-trier.de/db/journals/tc/tc32.html#MoretTG83},
  volume = 32,
  year = 1983
}

Downloads: 0