DurgaDatta
  • Member for 9 years, 5 months
  • Last seen more than a month ago
  • Hong Kong
Information Theory used to prove neat combinatorial statements?
3 votes

The equivalence of sampling and searching by Scott Aaronson. Here he shows the equivalence of sampling and searching problem in complexity theory in regards to validity of Extended Church-Turing ...

View answer