Niel de Beaudrap

2,373 reputation

318

bio	website
	location	Cambridge, United Kingdom
	age
visits	member for	10 months
	seen	21 hours ago
stats	profile views	70

Researcher in quantum information --- involving algebras over finite dimensional Hilbert spaces, graphs and combinatorics, 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.

	2,373 reputation	bio	website		visits	member for	10 months
318 badges		location	Cambridge, United Kingdom		seen	21 hours ago

summary answers questions tags badges favorites bounties reputation activity

27 Answers

votes activity newest

21	NP-Hard that is not NP-Complete and not Undecidable
16	Proving P = NP without mathematical statements / computer program
16	How can I verify a solution to Travelling Salesman Problem in polynomial time?
14	Are regular languages closed under sort?
11	Does a never-halting machine always loop?

2,373 Reputation

+25	Is there a binary search tree datastructure which can avoid becoming badly weight-balanced?
+70	Data Structure for Set Intersection?
+30	The difference between a bit and a Qubit
+10	Given a tree, find a vertex which maximizes the minimum distance to any leaf

1 Question

votes activity newest

5	Is there a binary search tree datastructure which can avoid becoming badly weight-balanced?

34 Tags

88 complexity-theory × 8	35 algorithms × 6
40 computability × 5	26 p-vs-np × 2
37 turing-machines × 6	21 terminology × 4
37 np-complete × 2	21 np-hard
35 quantum-computing × 7	19 np × 2

10 Accounts

$TeX - LaTeX Stack Exchange$	TeX - LaTeX	4,905 rep	930
	Philosophy	4,097 rep	426
	Theoretical Computer Science	4,070 rep	1140
$Mathematics Stack Exchange$	Mathematics	3,304 rep	623
	Computer Science	2,373 rep	318