Computer Science
zdm's user avatar
zdm's user avatar
zdm's user avatar
zdm
  • Member for 5 years, 10 months
  • Last seen this week
  • CA
Profile Activity
Stats
1,046
reputation
170k
reached
6
answers
30
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
9
silver badges
15
bronze badges
Top tags
View all tags
13
Score
3
Posts
8
Posts %
11
Score
20
Posts
56
Posts %
6
Score
3
Posts
8
Posts %
5
Score
6
Posts
17
Posts %
0
Score
12
Posts
33
Posts %
0
Score
5
Posts
14
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
26
Is there any reason why the modulo operator is denoted as %?
Dec 16, 2020
answer
11
Find median of unsorted array in $O(n)$ time
Feb 15, 2018
answer
5
NP-hard problems but only for n≥3
Nov 16, 2019
answer
4
How to solve T(n)=2T(√n)+log n with the master theorem?
Aug 20, 2018
question
3
Is this scheduling problem with arrival times, deadlines, and costs NP-hard?
Jul 24, 2018
question
3
Ordered set cover problem: is it NP-hard?
Aug 25, 2018
question
3
Is the knapsack problem NP-hard when $v_i=i$?
Apr 12, 2020
question
2
Given an array $A$, find all quadruples $(i,j,k,\ell)$ such that $i<j<k<\ell$ and $A[i]=A[k]$ and $A[j]=A[\ell]$?
Apr 7, 2018
question
2
How to define the potential function method for an online maximization problem?
May 9, 2018
question
2
How to solve $T(n)\leq n^2+n\left[T(n-m)+T(m-1)\right]$?
Aug 19, 2018
Top network posts
View all network posts
34
What to do if a reviewer's question is nonsense
28
On the <2k edit page, can we please see the comments on our post?
21
Argsorting values in a list of lists
19
Is an NP-hardness proof of an NP-hard problem considered a contribution?
16
Why are online lecture notes usually not accessible to non-students?

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.