Example: biology
On Lattices, Learning with Errors, Random Linear Codes ...

On Lattices, Learning with Errors, Random Linear Codes ...

Back to document page

Blum, Kalai, and Wasserman [11] provided the first subexponential algorithm for this problem. Their algorithm requires only2O(n=logn) equations/time and is currently the best known algorithm for the problem. It is based on a clever idea that allows to find a small set S of equations (say, O(p n)) among 2O(n=logn) equations, such that P

  With, Learning, Errors, Blum, Learning with errors

Download On Lattices, Learning with Errors, Random Linear Codes ...


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries