Sergei Artemenko

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits ACM Transactions on Computation Theory	2019-12-06	Paper
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)	2018-01-24	Paper
Pseudorandomness when the odds are against you	2017-10-10	Paper
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions Computational Complexity	2016-06-30	Paper
Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits Proceedings of the forty-sixth annual ACM symposium on Theory of computing	2015-06-26	Paper
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification Computational Complexity	2014-09-25	Paper
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2011-08-17	Paper

Research outcomes over time

This page was built for person: Sergei Artemenko