The All-Ones Problem for Binomial Trees, Butterfl‡y and Benes Networks

Paul Manuel, Indra Rajasingh, Bharathi Rajan, R Prabha


The all-ones problem is an NP-complete problem introduced by Sutner [11], with wide applications in linear cellular automata. In this paper, we solve the all-ones problem for some of the widely studied architectures like binomial trees, butterfly, and benes networks.

Full Text:



  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.