20
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Number of Restrictions of a Boolean Function act as a Complexity Measure

&
Pages 3-10 | Received 11 Mar 1996, Published online: 26 Mar 2015

REFERENCES

  • C E Shannon, The Synthesis of Two Terminal Switching Circuits, Bell Systems Technical Journal, vol BSTJ-28, pp 59–98, 1949.
  • M Davio, J P Deschamps & A Thayse, Discrete and Switching Functions, McGraw Hill International, 1978.
  • I Wegener, Complexity of Boolean Functions, Wiley-Teubner Series in Computer Science, 1987.
  • Y S Abu-Mostafa, The Complexity of Information Extraction, IEEE Trans Information Theory, vol IT-32, no 4, pp 513–526, July 1986.
  • R Ashenhurst, The Decomposition of Switching Function, reprinted in A New Approach to the Design of Switching Circuits, by A Curtis, Van Nostrand, Princeton, 1962.
  • A Curtis, A New Approach to the Design of Switching Circuits, Van Nostrand, Princeton, 1962.
  • V Chande, Restriction Complexity of Boolean Functions, MTech Thesis, Department of Electrical Engineering, Indian Institute of Technology, Bombay, 1995.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.