Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Jialong Shao
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(38)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Randomized Algorithms
(1)
Recent activity by Jialong Shao
4
answers
True or False: Every graph of 6 vertices must have either an Independent Set of size >= 3 or a clique of size >= 3.
answer edited
Dec 10, 2023
graph
clique
independent-set
9
answers
Solve this recurrence using master theorem: T(n) = 2 T(n/2) + n^0.75
answered
Sep 15, 2023
in
Asymptotic Analysis
recurrence-relations
master-theorem
time-complexity
asymptotic-analysis
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc