Physics – Condensed Matter – Disordered Systems and Neural Networks
Scientific paper
2011-02-16
J. Stat. Mech. (2011) P04015
Physics
Condensed Matter
Disordered Systems and Neural Networks
16 pages, 10 figures, matches published version
Scientific paper
10.1088/1742-5468/2011/04/P04015
Random instances of feedforward Boolean circuits are studied both analytically and numerically. Evaluating these circuits is known to be a P-complete problem and thus, in the worst case, believed to be impossible to perform, even given a massively parallel computer, in time much less than the depth of the circuit. Nonetheless, it is found that for some ensembles of random circuits, saturation to a fixed truth value occurs rapidly so that evaluation of the circuit can be accomplished in much less parallel time than the depth of the circuit. For other ensembles saturation does not occur and circuit evaluation is apparently hard. In particular, for some random circuits composed of connectives with five or more inputs, the number of true outputs at each level is a chaotic sequence. Finally, while the average case complexity depends on the choice of ensemble, it is shown that for all ensembles it is possible to simultaneously construct a typical circuit together with its solution in polylogarithmic parallel time.
DeDeo Simon
Machta Jon
Mertens Stephan
Moore Cristopher
No associations
LandOfFree
Parallel Complexity of Random Boolean Circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parallel Complexity of Random Boolean Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel Complexity of Random Boolean Circuits will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-417094