Theoretical Computer Science
Adam Bouland
  • Member for 8 years, 11 months
  • Last seen more than a month ago
Profile Activity
Stats
703
reputation
3k
reached
5
answers
1
question
Communities
About

I am a postdoc in the theory of computation group at UC Berkeley working with Umesh Vazirani. I study quantum complexity theory and connections with physics.

Badges
View all badges
This user doesn’t have any gold badges yet.
4
silver badges
10
bronze badges
Top tags
View all tags
34
Score
4
Posts
67
Posts %
23
Score
1
Posts
17
Posts %
23
Score
1
Posts
17
Posts %
9
Score
3
Posts
50
Posts %
6
Score
1
Posts
17
Posts %
5
Score
1
Posts
17
Posts %
Top posts
All Questions Answers
Votes Newest
23
Books/Lecture Notes on Parametrized Complexity
May 22 '13
6
FPT algorithm for Partial k-tree Isomorphism
Nov 7 '13
5
Geometric Interpretation of Computation
Sep 30 '13
5
theorems for universal set of quantum gates for SU(d)
May 11 '16
4
Techniques for lower bounding spectral gaps in the quantum adiabatic algorithm
Nov 19 '13
4
Clarification for argument in proof of search in N^1/3 queries with hidden variables/non-collapsing measurements
Feb 20 '15
Top network posts
View all network posts
8
Do rotations about any three non-collinear axes generate $SO(3)$?
6
Polynomials with $S_n \times \mathbb{Z}_2$ symmetry

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.