What people are saying - Write a review
We haven't found any reviews in the usual places.
Regular Resolution versus Unrestricted Resolution
Local Randomness in Polynomial Random Number and Random Function Generators
Applying Coding Theory to Sparse Interpolation
28 other sections not shown
Other editions - View all
accepted algorithm apply approximation arcs assume block bound candidate circles claim clauses complexity Comput condition consider consists construct contains COROLLARY corresponding data structure decides define definition denote described determine distribution edge efficient elements error estimate example exists expected extension fact finite fixed follows formula function given graph Hence holds implies independent induction input instance intersection learning least leaves Lemma length linear lower bound matrix maximum negative node Note obtain occurs optimal output pairs parallel partition path polynomial positive prefix present probability problem proof prove query random reduce representation resolution respectively result root running sample satisfies segment sequence space stage step string structure subset suffix Theorem Theory total order tree University variables vertices votes weight