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