We study in this paper the computational complexity of some
equivalence relations on polynomial systems of equations over finite
fields. These problems are analyzed with respect to polynomial-time
many-one reductions (resp. Turing reductions, Levin reductions). In
particular, we show that some of these problems are between ... more >>>

A statistical zero knowledge argument for NP is a cryptographic primitive that allows a polynomial-time prover to convince another
polynomial-time verifier of the validity of an NP statement. It is guaranteed that even an infinitely powerful verifier does not learn any
additional information but the validity of the claim.

Naor ... more >>>

We present a deterministic O(log n log log n) space algorithm for
undirected s,t-connectivity. It is based on the deterministic EREW
algorithm of Chong and Lam (SODA 93) and uses the universal
exploration sequences for trees constructed by Kouck\'y (CCC 01).
Our result improves the O(log^{4/3} n) bound of Armoni ... more >>>