Timeline for Reducing search space by probability
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 14, 2014 at 4:14 | comment | added | Douglas Zare | @David Wihl: Information theory gives you some lower bounds. I'm not sure how to get upper bounds out of its results. The idea that random guesses are usually efficient parallels a proof from information theory, that random codes are asymptotically optimal. | |
| Mar 13, 2014 at 22:03 | comment | added | David Wihl | Thanks for your analysis. I'm going to try exploring Shannon Entropy and post back here if I find something interesting. | |
| Mar 12, 2014 at 14:55 | history | answered | Douglas Zare | CC BY-SA 3.0 |