Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Mathematical Structures Underlying Greedy Algorithms
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization
Discrete Applied Mathematics - Special issue: Efficient algorithms
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
The unified theory of pseudorandomness: guest column
ACM SIGACT News
Addendum to “simple constructions of almost k‐wise independent random variables”
Random Structures & Algorithms
IEEE Transactions on Information Theory
A matroidal approach to rough set theory
Theoretical Computer Science
| Hi-index | 5.23 |
We show that the maximum matroid-greedoid partition problem isNP-hard to approximate to within 1/2+ε for anyε0, which matches the trivial factor 1/2 approximationalgorithm. The main tool in our hardness of approximation result isan extractor code with polynomial rate, alphabet size andlist size, together with an efficient algorithm for list-decoding.We show that the recent extractor construction of Guruswami, Umansand Vadhan [V. Guruswami, C. Umans, S.P. Vadhan, Unbalancedexpanders and randomness extractors from Parvaresh-Vardy codes, in:IEEE Conference on Computational Complexity, IEEE Computer Society,2007, pp. 96-108] can be used to obtain a code with theseproperties. We also show that the parameterized matroid-greedoidpartition problem is fixed-parameter tractable.