The frequency moments of a sequence containingmielements of typei, 1?i?n, are the numbersFk, when the elements of the sequence are given one by one and cannot be stored.Expand

The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that used O(f) random bits of its oracle and behaves as follows: If x in L then there exists an oracle y such that the machine accepts for all random choices but if x not in L the machine rejects with high probability.Expand

We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof.Expand

We characterize the degree of the polynomial representing a boolean function in terms of certain combinatorial properties of the boolean function.Expand

Motivated by Manuel Blum’s concept of inst ante checking, we consider new, very fast and generic mechanisms of checking computations. Our results exploit recent advances in interactive proof… Expand

In this paper, we study algorithms for tracking (approximate) self-join sizes in limited storage in the presence of insertions and deletions to the relations.Expand

We prove lower bounds of the form Ω(n · c−k), for the number of bits that need to be exchanged in order to compute some (explicitly given) polynomial time computable functions.Expand