Comments for Not so Great Ideas in Theoretical Computer Science

sir i want a numerical example on the basis of instance selection usinh locality sensitive hashing (LSH-IS) ibut i cannot pretend how to compute this in mathematics so plz help me

https://mittheory.wordpress.com/2013/11/22/beyond-lsh/comment-page-1/#comment-556

That's a very nice summary of the paper: thanks! I once asked on CSTheory how to do this. One comment pointed me to the paper you mention. There's also an answer pointing to some more recent work...

https://mittheory.wordpress.com/2016/10/03/estimating-transitive-closure/comment-page-1/#comment-509

In reply to Urbanowicz. Yes, the first problem can be solved for any f. But see ...

https://mittheory.wordpress.com/2016/10/03/estimating-transitive-closure/comment-page-1/#comment-506

Why do we requre $f$ to be special (in terms of randomness) in Problem 1? Seems like it will work for any reasonable $f$.

https://mittheory.wordpress.com/2016/10/03/estimating-transitive-closure/comment-page-1/#comment-504

In reply to npc. Hi npc, Sorry for the late response! Yes...

https://mittheory.wordpress.com/2015/08/15/purifying-spoiled-randomness-with-spoiled-randomness/comment-page-1/#comment-503

This doesn't seem as exciting to me as you make it sound, so I'd like to understand what this is a little better, if you'll indulge me. It seems to me that a weak source of randomness means you h...

https://mittheory.wordpress.com/2015/08/15/purifying-spoiled-randomness-with-spoiled-randomness/comment-page-1/#comment-483

Could you point us to some source code implementing this?

https://mittheory.wordpress.com/2015/08/15/purifying-spoiled-randomness-with-spoiled-randomness/comment-page-1/#comment-482

Reblogged this on Exponentials and co...

https://mittheory.wordpress.com/2014/07/07/faster-i-say-the-race-for-the-fastest-sdd-linear-system-solver-stoc-2014-recaps-part-9/comment-page-1/#comment-345

You're right that the security property they prove is like the one you mention. However, this together with the ordinary (indistinguishability against chosen-plaintext attack) security of the enc...

https://mittheory.wordpress.com/2014/06/27/spaghetti-code-crypto-stoc-2014-recaps-part-6/comment-page-1/#comment-111

were both named after our good friend Siméon. **For another perspective on the SIIRV result, see this post by my partner in crime,

https://mittheory.wordpress.com/2013/11/15/focs-2013-recaps-part-2/comment-page-1/#comment-108