Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Ramprasad
Kanpur, India
cmi.ac.in/~ramprasad
Age: 26
PhD student, currently at IIT Kanpur
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
16
votes
Fooling arbitrary symmetric functions
cc.complexity-theory
derandomization
space-bounded
pseudorandomness
asked Oct 13 '10 at 8:03
cstheory.stackexchange.com
8
votes
Grigoriev-Karpinski for the permanent
lower-bounds
permanent
arithmetic-circuits
determinant
asked Apr 27 at 6:56
cstheory.stackexchange.com
6
votes
PCPs with imperfect completeness
cc.complexity-theory
reductions
pcp
asked Nov 8 '10 at 9:07
cstheory.stackexchange.com
6
votes
Results in computer science via the Stepanov method
reference-request
polynomials
asked Sep 22 '11 at 10:48
cstheory.stackexchange.com
Top Answers
25
Polynomial method for complexity results
cstheory.stackexchange.com
17
How to check if a number is a perfect power in polynomial time
cstheory.stackexchange.com
15
What is the best way to get a close-to-fair coin toss from identical biased coins?
cstheory.stackexchange.com
15
Why are mod_m gates interesting?
cstheory.stackexchange.com
13
Deterministic Parallel algorithm for perfect matching in general graphs?
cstheory.stackexchange.com
8
A Boolean function that is not constant on affine subspaces of large enough dimension
cstheory.stackexchange.com
8
Funny TCS-related papers etc?
cstheory.stackexchange.com
8
On fooling $AC^0$
cstheory.stackexchange.com
7
Does coNP-complete problem have subexponential size certificate?
cstheory.stackexchange.com
6
Is there an alternate proof or an exposition of: Exponential lower bound for $\Sigma\Pi\Sigma$ circuits [Grigoriev-Karpinski(1998)]?
cstheory.stackexchange.com
5
Applications of association schemes to complexity theory and other TCS
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
