## 31st annual Symposium on Foundations of Computer Science: proceedings, October 22-24, 1990, St. Louis, Missouri |

### From inside the book

Try this search over all volumes: **sample space**

Results 1-0 of 0

### What people are saying - Write a review

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

### Contents

Session | xiv |

Security Preserving Ampliﬁcation of Hardness 318 | 552 |

Separating DistributionFree and MistakeBound Learning Models | 562 |

Copyright | |

15 other sections not shown

### Common terms and phrases

3-coloring 6-sources adversary automata automaton Baruch Awerbuch bits block Boolean functions chordal graphs clusters competitive competitive ratio Computer Science conﬁguration consider constant construction cost database deﬁne Deﬁnition denote depth deterministic distributed edge-connectivity ﬁnal ﬁnd ﬁnite ﬁrst ﬁxed ﬂow fork formula gates given gorithm graph coloring graph G IEEE independent induction inﬁnite input integer k-server algorithm k-server problem Lemma linear logic loner lower bound matrix metric space move multiple node Noga Alon number of colors number of slots O(log on-line algorithm optimal output pair Paley Graph partition phase polynomial PRAM probability problem Proc procedure processor proof Proposition protocol prove pulse random ratio real tree request result rithm sample space satisﬁes sequence servers solution speciﬁc step strings sub-phase subset synchronizer Theorem Theory threshold circuit tion total number tree replicas UPDATE variables vertex vertices