Andy Drucker
Postdoc at U. Edinburgh. My research focus is computational complexity.
-
Edinburgh, UK
-
Member for 10 years, 6 months
-
15 profile views
-
Last seen Mar 29 '15 at 23:54
Communities (10)
Top network posts
- 34 What kind of mathematical background is needed for complexity theory?
- 28 Good codes decodable by linear-sized circuits?
- 28 Why does randomness have stronger effect on reductions than on algorithms?
- 26 Cryptography without assumptions -- seeking an overview
- 23 Examples where the uniqueness of the solution makes it easier to find
- 21 Is optimally solving the n×n×n Rubik's Cube NP-hard?
- 20 The cozy neighborhoods of "P" and of "NP-hard"
- View more network posts →
Keeping a low profile.
This user hasn't posted yet.
Badges (12)
Gold
—
Silver
10
Rarest
Bronze
2
Rarest
-
Sep 10 '10
-
Sep 24 '14