We changed our privacy policy. Read more.
Theoretical Computer Science
Andy Drucker
Profile Activity
Stats
4,574
reputation
50k
reached
30
answers
4
questions
About

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

Communities (10)

Top network posts

This user doesn’t have any gold badges yet.
21
silver badges
32
bronze badges
View all badges

Top tags (47)

Score 279
Posts 22
Posts % 65
Score 51
Posts 4
Score 43
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
34 What kind of mathematical background is needed for complexity theory? Oct 31 '10
28 Why does randomness have stronger effect on reductions than on algorithms? Dec 25 '12
27 Good codes decodable by linear-sized circuits? Apr 10 '11
26 Cryptography without assumptions -- seeking an overview Dec 4 '13
23 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
20 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 →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.