firebatpi

3 ms·

1. 1.▲
   The Argument Against Quantum Computers by Gil Kalai [pdf](arxiv.org)

   12 points by firebatpi 7y ago|3 comments
2. 2.▲
   by firebatpi 7y ago

   There's no need to solve the distribution balancing problem with linear programming. You can just use a greedy algorithm where you repeatedly give probability mass from numbers with more than 10% to numbers with less.
3. 3.▲
   by firebatpi 7y ago

   Graph isomorphism is actually not known to be NP-complete. Many complexity theorists believe it isn't, since if it is, then the polynomial hierarchy collapses.