## 26th Annual Symposium on Foundations of Computer Science: October 21-23, 1985 |

### From inside the book

Try this search over all volumes: **corresponding**

Results 1-0 of 0

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Deterministic Simulation of Probabilistic Constant Depth Circuits | 11 |

Amplification of Probabilistic Boolean Formulas | 20 |

On Networks of Noisy Gates | 30 |

34 other sections not shown

### Common terms and phrases

algorithm Algorithm FGK apply approximation algorithm assignment assume binary bits Boolean Boolean function chain circuit coin flipping complexity Computer Science connected components constant construction contains cycle data structure defined denote deterministic distribution edges elements embedding encoding endpoint factor finite formula fragment function given IEEE independent induction input integer intersection iteration label layer least Lemma length linear logn lower bound matching matrix matroid maximum merging minimum node obtain optimal output pair parallel parallel algorithms partition path permutation permutation graph planar graph polynomial probabilistic probability problem Proc processors proof protocol prove pushdown random variable recursive requires result rithm root scheme segment sequence simulate solution solved sorting step string subgraph subset Theorem Theory tion tree undirected graph upper bound vector vertex vertices VLSI weight wires