On the power of two-point based sampling
- 1 March 1989
- journal article
- Published by Elsevier BV in Journal of Complexity
- Vol. 5 (1), 96-106
- https://doi.org/10.1016/0885-064x(89)90015-0
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Eigenvalues and expandersCombinatorica, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- How to share a secretCommunications of the ACM, 1979
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- On a Set of Almost Deterministic $k$-Independent Random VariablesThe Annals of Probability, 1974