## 39th Annual Symposium on Foundations of Computer Science: Proceedings : November 8-11, 1998, Palo Alto, California |

### What people are saying - Write a review

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

### Contents

Theoretical Issues in Probabilistic Artificial Intelligence | 4 |

Probabilistically Checkable Proofs with Low Amortized Query Complexity | 18 |

Improved Decoding of ReedSolomon and AlgebraicGeometric Codes | 28 |

Copyright | |

47 other sections not shown

### Other editions - View all

### Common terms and phrases

algorithm apply approximation assignment assume bits called circuit complexity Computer condition consider consistent constant construction contains corresponding cost defined definition denote described distance distribution edge elements equal equation error example exists expected faces fact factor Figure finite flow function give given graph Hence holds implies improved input instance integer known least Lemma length linear lower bound matching matrix method metric minimal moves multiplication node Note obtain optimal oracle pair path player polynomial positive possible probability problem proof protocol prove quantum queries random respectively result round running sampling satisfying Science separator sequence solution solve space step strategy string structure subset Suppose Theorem Theory tion tree variables vector verifier vertex vertices weight