Computing with Real Numbers, from Archimedes to Turing and Beyond
How to test the usefulness of computation for understanding and predicting continuous phenomena.
Mark Braverman
Advertisement
Author Archives
Poly-Logarithmic Independence Fools Bounded-Depth Boolean Circuits
The question of determining which (weak) forms of randomness "fool" (or seem totally random to) a given algorithm is a basic and fundamental question in the modern theory of computer science. In this work we report progress on this question.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved