This paper revisits the study of two classical technical tools in theoretical computer science:
Yao's trans-formation of distinguishers to next-bit predictors (FOCS 1982), and the …

We reduce the problem of detecting the existence of an object to the problem of computing
the parity of the number of objects in question. In particular, when given any non-empty set …

Cloud storage is used wildly as online data storing and sharing paradigm today. And
customers are willing to protect their data by cryptographic access control mechanisms. The …

The Isolation Lemma of Mulmuley, Vazirani and Vazirani [Combinatorica'87] provides a self-
reduction scheme that allows one to assume that a given instance of a problem has a …

Drucker (Proceedings of the 53rd annual symposium on foundations of computer science
(FOCS), pp 609–618. doi: 10.1109/FOCS. 2012.71, 2012) proved the following result …

We study the possibility of deterministic and randomness-efficient isolation in space-
bounded models of computation: Can one efficiently reduce instances of computational …

Drucker [1] proved the following result: Unless the unlikely complexity-theoretic collapse
coNP⊆ NP/poly occurs, there is no AND-compression for SAT. The result has implications …

We construct a probabilistic polynomial algorithm for testing the satisfiability of algebraic
formulas of depth 3 over the two-element field, with addition as the top operation in the …

Proving circuit lower bounds is one of the most difficult tasks in computational complexity
theory. The NP vs. P/poly problem asks whether there are small non-uniform circuits that can …

Построен вероятностный полиномиальный алгоритм проверки выполнимости
алгебраических формул глубины 3 над полем из двух элементов, верхней операцией в …