Stack Exchange

nir shahar

Israel

Im a CS student currently learning in the Tel-Aviv University

top accounts reputation activity bookmarks subscriptions
Top Questions
Top Answers
39
Example of a graph with negative weighed edges in which Dijkstra's algorithm does work
cs.stackexchange.com

37
Time complexity $O(m+n)$ Vs $O(n)$
cs.stackexchange.com

29
How can a Turing machine compare two strings without modifying them?
cs.stackexchange.com

13
Is an integer variable constant or logarithmic space?
cs.stackexchange.com

10
Algorithm to get any spanning tree not necessarily a minimum spanning tree
cs.stackexchange.com

10
Is there any NP-hard problem which was proven to be solved in polynomial time or at least close to polynomial time?
cs.stackexchange.com

9
How can a Turing machine compare two strings without modifying them?
cs.stackexchange.com

8
Is discrete math enough for computer science ? Or there other Math topics that I should also learn With it?
cs.stackexchange.com

7
What is this algorithm computing and how to prove it?
cs.stackexchange.com

7
Is calling a function considered a context switching?
stackoverflow.com

7
Group theory — Lagrange's theorem does not seem to hold
math.stackexchange.com

6
What algorithm do SVMs use to minimize their objective function?
cs.stackexchange.com

5
How do computers *really* work? (at the most basic level)
cs.stackexchange.com

5
Polynomial time optimization problems belong to which complexity class?
cs.stackexchange.com

5
Why are all regular languages in P?
cs.stackexchange.com

5
An integer (a string of digits) is $\text{/[0-9][0-9]$\ast$/}$. (Why isn't it just $\text{/[0-9]$\ast$/}$?)
cs.stackexchange.com

5
tautology vs satisfiability
cs.stackexchange.com

5
Can you string together inequalities and equalities into a single statement?
math.stackexchange.com

5
Why can't I use a polynomial-time reduction for proving P-completeness?
cs.stackexchange.com