DMCA
The All-Ones Problem for Binomial Trees, Butterfly and Benes Networks
by
Paul Manuel
,
Indra Rajasingh
,
Bharathi Rajan
,
R. Prabha
BibTeX
@MISC{Manuel_theall-ones,
author = {Paul Manuel and Indra Rajasingh and Bharathi Rajan and R. Prabha},
title = {The All-Ones Problem for Binomial Trees, Butterfly and Benes Networks},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The all-ones problem is an NP-complete problem introduced by Sutner [11], with wide applica-tions 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.
