Nina Overflow
Request account
Log in
Loading …
Topic groups
/
A&W
+ New post
Filters
Show ▼
Subtopics: on
View
List
📁 Folders
Type
All
2
? Questions
1
! Remarks
0
↗ Resources
1
Subtopic
All
6
flow
2
MIN-CUT
2
probabilistic algorithms
2
probability
1
▸ More filters
▾ Fewer filters
Folders
by Subtopic
by Person
by Type
by Status
Sort
Newest
Unanswered first
Most relevant
Status
All
2
Open
📁
MIN-CUT
1
?
Why does Karger's MIN-CUT algorithm succeed with probability ≥ 2/(n(n−1))?
open
labubu
· 3 h ago
probabilistic algorithms
MIN-CUT
▲ 0
same question · 0
1 answer
📁
probabilistic algorithms
2
1
Closed
0
Material
All
2
Slides / lectures
0
Script
0
Homework
0
Exams
0
Labs
0
Other
0
Topic
A&W
Analysis 1
Lineare Algebra
Parallel Programming
other
Person
Apply
Time
last
days
Apply
↗
Cheat-sheet: tail bounds (Markov, Chebyshev, Chernoff) with when to use each
nina
· 3 h ago
probability
probabilistic algorithms
▲ 0
?
Why does Karger's MIN-CUT algorithm succeed with probability ≥ 2/(n(n−1))?
open
labubu
· 3 h ago
probabilistic algorithms
MIN-CUT
▲ 0
same question · 0
1 answer
📁
probability
1
↗
Cheat-sheet: tail bounds (Markov, Chebyshev, Chernoff) with when to use each
nina
· 3 h ago
probability
probabilistic algorithms
▲ 0