The following pages link to Manuel Blum (Q6481013):
Displaying 1 item.
- (Q1144941) (redirect page) (← links)
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (Q1144943) (← links)
- (Q1162527) (redirect page) (← links)
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- Time bounds for selection (Q1394121) (← links)
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain (Q1822415) (← links)
- On the problem of sorting burnt pancakes (Q1897357) (← links)
- A stagewise parameter estimation procedure for correlated data (Q2394867) (← links)
- Naturally Rehearsing Passwords (Q2867165) (← links)
- (Q3128932) (← links)
- (Q3197310) (← links)
- (Q3212297) (← links)
- (Q3332246) (← links)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits (Q3339289) (← links)
- (Q4638058) (← links)
