Theoretical Computer Science
Meta user
Network profile
4,099
reputation
18
31

Andy Drucker

Postdoc at U. Edinburgh. My research focus is computational complexity.

30
answers
4
questions
~43k
people reached

Communities (10)

Top network posts

Top tags (47)

Score 271
Posts 22
Posts % 65
Score 49
Posts 4
Score 42
Posts 5
Score 39
Posts 3
Score 35
Posts 3
Score 26
Posts 2
View all tags →

Top posts (34) All Questions Answers | Votes Newest

32 What kind of mathematical background is needed for complexity theory? Oct 31 '10
28 Good codes decodable by linear-sized circuits? Apr 10 '11
28 Why does randomness have stronger effect on reductions than on algorithms? Dec 25 '12
25 Cryptography without assumptions — seeking an overview Dec 4 '13
22 Examples where the uniqueness of the solution makes it easier to find Apr 13 '14
21 Is optimally solving the n×n×n Rubik's Cube NP-hard? Jun 29 '11
19 The cozy neighborhoods of “P” and of “NP-hard” Dec 24 '12
18 If P = BQP, does this imply that PSPACE (= IP) = AM? Nov 2 '10
17 Fast convolution over small finite fields Jul 27 '11
17 Lower bounds on Gaussian complexity Aug 18 '10
View all questions and answers →

Badges (49)

Gold

—

Silver

18

Rarest

Bronze

31

Rarest

View all badges →