STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Almost k-wise independent sets establish hitting sets for width-3 1-branching programs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Simplified derandomization of BPP using a hitting set generator
Studies in complexity and cryptography
A sufficient condition for sets hitting the class of read-once branching programs of width 3
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Hi-index | 0.00 |