Computer Science
Albert Hendriks's user avatar
Albert Hendriks's user avatar
Albert Hendriks's user avatar
Albert Hendriks
  • Member for 8 years, 9 months
  • Last seen more than a month ago
Profile Activity
Stats
2,469
reputation
65k
reached
27
answers
34
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
14
silver badges
34
bronze badges
Top tags
View all tags
30
Score
15
Posts
25
Posts %
29
Score
16
Posts
26
Posts %
26
Score
4
Posts
7
Posts %
25
Score
4
Posts
7
Posts %
16
Score
8
Posts
13
Posts %
14
Score
15
Posts
25
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
19
Deterministic linear time algorithm to check if one array is a sorted version of the other
Jan 4, 2016
answer
18
How to prove the existence of a number which cannot be written by any algorithm?
May 13, 2018
question
16
NP-complete problem with a polynomial number of yes-instances?
Apr 22, 2018
question
13
Is 2-SAT with XOR-relations NP-complete?
May 13, 2015
question
12
Why does Schaefer's theorem not prove that P=NP?
May 14, 2015
answer
11
Why are Chess, Mario, and Go not NP-complete?
Feb 23, 2017
question
10
2-dimensional ranking of multiple arrays
Sep 13, 2020
question
7
sequence of problems that take $\Theta(n^k)$ for increasing $k$?
Nov 29, 2016
answer
7
Is there a polynomial time algorithm to determine whether an 'up down' language is 'emptible'?
Jun 26, 2017
answer
7
The relation between 2SAT and 3SAT
Mar 13, 2015
Top Meta posts
2
0
4
Is it okay to ask for edits?
3
Why are there no comments on "Is it NP-hard to fill up bins with minimum moves?"
Top network posts
View all network posts
81
MockitoJUnitRunner is deprecated
22
How to use the Intel AVX in Java?
17
Number of assignments necessary to find the minimum value in an array?
16
mingw 64 ships without make.exe?
16
Do more roads lead to fewer traffic jams?

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.