Theoretical Computer Science
Meta user
Network profile
6,939
reputation
26
64

Niel de Beaudrap

Researcher in quantum information and counting complexity — involving algebras over finite dimensional Hilbert spaces, graphs and combinatorics, algebraic number fields, and vector spaces over ℤ/pℤ.

I habitually edit and re-edit anything I write, as long as I have the time, interest, and ability. I should probably apologize for this tendency, but you will probably have to be satisfied with being warned about it instead.

55
answers
23
questions
~50k
people reached
  • Oxford, United Kingdom
  • Member for 9 years, 1 month
  • 1,093 profile views
  • Last seen Aug 23 at 19:21

Communities (13)

Top Meta Posts
0
3

Top network posts

Top tags (68)

Score 205
Posts 32
Posts % 41
Score 198
Posts 31
Score 78
Posts 12
Score 42
Posts 5
Score 34
Posts 9
Score 32
Posts 7
View all tags →

Top posts (78) All Questions Answers | Votes Newest

37 Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems? Mar 7 '11
28 Consequences of NP=PSPACE Feb 13 '14
27 What are the consequences of Parity-L = P? Aug 17 '10
26 Adiabatic quantum computing with level crossings Feb 11 '12
24 What is the quantum computational model? Aug 24 '10
19 Is solving systems of equations modulo $k$ in $\mathsf{coMod}_k\mathsf L$ for $k$ composite? Nov 11 '11
18 Best known joint containments for/by NP and Parity-P? Aug 17 '10
18 What is the counting complexity of random 2-SAT? Mar 16 '12
17 What are the #P-complete subfamilies of #2-SAT? Nov 29 '12
17 A Notion of Monotone Quantum Circuits Sep 18 '12
View all questions and answers →

Badges (90)

Gold

—

Silver

26

Rarest

Bronze

64

Rarest

View all badges →