Results from the 2022 Developer Survey are now available
Theoretical Computer Science
user avatar
user avatar
user avatar
Andy Drucker
  • Member for 11 years, 10 months
  • Last seen more than a month ago
Profile Activity
Stats
4,584
reputation
52k
reached
30
answers
4
questions
Communities
View all
About

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

Badges
View all badges
This user doesn’t have any gold badges yet.
21
silver badges
32
bronze badges
Top tags
View all tags
279
Score
22
Posts
65
Posts %
51
Score
4
Posts
12
Posts %
43
Score
5
Posts
15
Posts %
39
Score
3
Posts
9
Posts %
35
Score
3
Posts
9
Posts %
26
Score
2
Posts
6
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
34
What kind of mathematical background is needed for complexity theory?
Oct 31, 2010
answer
28
Why does randomness have stronger effect on reductions than on algorithms?
Dec 25, 2012
question
27
Good codes decodable by linear-sized circuits?
Apr 10, 2011
question
27
Cryptography without assumptions -- seeking an overview
Dec 4, 2013
answer
23
Examples where the uniqueness of the solution makes it easier to find
Apr 13, 2014
answer
21
Is optimally solving the n×n×n Rubik's Cube NP-hard?
Jun 29, 2011
answer
20
The cozy neighborhoods of "P" and of "NP-hard"
Dec 24, 2012
answer
18
If P = BQP, does this imply that PSPACE (= IP) = AM?
Nov 2, 2010
question
17
Fast convolution over small finite fields
Jul 27, 2011
answer
17
Lower bounds on Gaussian complexity
Aug 18, 2010
Top network posts
View all network posts
9
The "sensitivity" of 2-colorings of the d-dimensional integer lattice
6
Want theorem and equation numbering linked under section

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.