Computer Science
Meta user
Network profile
7,425
reputation
24
43

Pål GD

Leading Advisor Software Engineering, former researcher in Algorithms, former programmer, phone systems admin and electronics engineer.

Interests in

  • Software Engineering
  • Algorithms and Graph theory
  • Logic (mostly modal logics)
  • Applied algorithms and graph theory on Android
  • Climbing & bouldering
146
answers
0
questions
~294k
people reached
  • Bergen, Norway
  • pgdr
  • github.com/pgdr
  • Member for 7 years, 1 month
  • 887 profile views
  • Last seen Oct 22 at 16:22

Communities (57)

Top Meta Posts
1
1

Top network posts

Top tags (112)

Score 150
Posts 27
Posts % 18
Score 123
Posts 40
Score 120
Posts 34
Score 118
Posts 17
Score 52
Posts 12
Score 50
Posts 8
View all tags →

Top posts (146) All Questions Answers | Votes Newest

95 What important/crucial real-world applications use blockchain? Jan 6
32 Are there subexponential-time algorithms for NP-complete problems? Feb 15 '13
19 Which NP-Complete problem has the fastest known algorithm? May 4 '14
15 What is the use of finding minimum number of straight lines to cover a set of points? May 3 '15
15 What is a lay explanation for universal search? Mar 22 '15
14 How to prove a problem is NOT NP-Complete? Jun 21 '13
14 What is the decision version of independent set? Jan 31 '13
13 what is difference between multilayer perceptron and multilayer neural network? Feb 26 '16
13 What should I do with a bunch of 16-17 year olds to get them interested in computer science? Jun 24 '13
11 Are there any natural $\Pi_2^P$-complete problems? Apr 18 '15
View all questions and answers →

Badges (67)

Gold

—

Silver

24

Rarest

Bronze

43

Rarest

View all badges →