Niel de Beaudrap

Member for 10 years, 2 months
Last seen more than a month ago

Oxford, United Kingdom

Summary

Reputation

4,101

4.1k
4k
3.8k

2019
2020
2021
2022

Top tag

complexity-theory

Next privilege

5,000 Rep.

Approve tag wiki edits

Badges

1

16

32

Newest

Yearling

Next badge

0/1

Informed

Answers

View all 34 answers

Score Activity Newest

36

How can I verify a solution to Travelling Salesman Problem in polynomial time?

Jul 20, 2012

34

NP-Hard problems that are not in NP but decidable

Jan 21, 2013

22

Is the set of Turing machines which stops in at most 50 steps on all inputs, decidable?

Aug 9, 2012

22

How hard is finding the discrete logarithm?

Jul 16, 2012

19

Proving P = NP without mathematical statements / computer program

Jan 3, 2013

Questions

Score Activity Newest Views

7

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

May 3, 2013

Tags

View all 41 tags

complexity-theory

170

Score

10

posts

computability

99

Score

6

posts

quantum-computing

59

Score

9

posts

algorithms

55

Score

6

posts

turing-machines

51

Score

6

posts

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

1

gold badge

Populist

Feb 23, 2015

16

silver badges

Enthusiast

Aug 11, 2012
Good Answer

× 2

Apr 13, 2015
Enlightened

× 3

Jun 19, 2014

32

bronze badges

Cleanup

Jan 8, 2014
Quorum

Oct 25, 2012
Explainer

Sep 30, 2014

Bookmarks

Score Activity Newest Views Added

20

Problems in P with provably faster randomized algorithms

Jun 13, 2012

Accounts

View all 13 accounts

13.7k
5
45
61

Quantum Computing

11.1k
1
22
63

9,810
4
31
52

Theoretical Computer Science

8,841
29
68

5,868
1
25
38

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

100

upvotes

17

downvotes

50

question votes

67

answer votes