|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| N.N. Biswas, "On Identification of Totally Symmetric Boolean Functions," IEEE Transactions on Computers, vol. 19, no. 7, pp. 645-648, July, 1970. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1970.222997, author = {N.N. Biswas}, title = {On Identification of Totally Symmetric Boolean Functions}, journal ={IEEE Transactions on Computers}, volume = {19}, number = {7}, issn = {0018-9340}, year = {1970}, pages = {645-648}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.222997}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On Identification of Totally Symmetric Boolean Functions IS - 7 SN - 0018-9340 SP645 EP648 EPD - 645-648 A1 - N.N. Biswas, PY - 1970 KW - Symmetric function. VL - 19 JA - IEEE Transactions on Computers ER - | |||
This paper shows how a "unity-ratio" totally sym-metric function can be identified without any further decomposition. The identification is carried out by writing the given function in its ordered partitioned tabular form. The method is general, straightforward, and programmable on a digital computer.
Index Terms:
Symmetric function.
Citation:
N.N. Biswas, "On Identification of Totally Symmetric Boolean Functions," IEEE Transactions on Computers, vol. 19, no. 7, pp. 645-648, July 1970, doi:10.1109/T-C.1970.222997
Usage of this product signifies your acceptance of the Terms of Use.

