Computer Science
aelguindy
  • Zürich, Switzerland
  • Member for 9 years, 6 months
Profile Activity
Stats
1,767
reputation
43k
reached
23
answers
3
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (15)

Top network posts

This user doesn’t have any gold badges yet.
13
silver badges
17
bronze badges
View all badges

Top tags (39)

Score 33
Posts 10
Posts % 38
Score 21
Posts 6
Score 18
Posts 3
Score 16
Posts 3
Score 15
Posts 8
Score 13
Posts 2
View all tags →

Top posts (26)

All Questions Answers
Votes Newest
28 Proof of the undecidability of the Halting Problem Nov 1 '16
20 Problems in P with provably faster randomized algorithms Jun 13 '12
10 Why is the time complexity of insertion sort not brought down even if we use binary search for the comparisons? Nov 5 '16
9 Conditions for bipartite graph to be planar with no edges going around the vertices Oct 25 '16
8 Can exactly one of NP and co-NP be equal to P? Jun 12 '12
7 Is finding a set cover of size $k$ NP-complete? Nov 6 '16
7 Can we do better than $O(n\log n)$ building a balanced binary tree? Nov 5 '16
6 Is the set cover problem NP-complete when the cardinality of the collection of sets is equal to the cardinality of the universe? Nov 1 '16
5 Heuristic algorithms for the dense assignment problem Nov 5 '16
5 Closest pair of points between two sets, in 2D Nov 5 '16
View all questions and answers →

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.