Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Amrinder Arora
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)
Answers by Amrinder Arora
+2
votes
Cook-Levin Theorem
answered
Dec 6, 2016
in
NP-Completeness
+2
votes
Rectangles overlap
answered
Dec 5, 2016
in
Divide & Conquer
0
votes
MVCS using Divide and Conquer
answered
Dec 3, 2016
in
Divide & Conquer
mvcs
d&c
0
votes
Make change using smallest number of coins of given denominations
answered
Dec 3, 2016
in
Dynamic Programming
dynamic-programming
+1
vote
Tree method or PMI?
answered
Sep 28, 2016
in
Divide & Conquer
recurrence-relations
0
votes
Can T(n) = 2T(n/2) + nlogn use master theorem?
answered
Sep 20, 2016
in
Divide & Conquer
master-theorem
recurrence-relations
+4
votes
Recurrence relation : T(n) = T(n/3) + 2 T(2n/3) + n
answered
Sep 20, 2016
in
Asymptotic Analysis
time-complexity
recurrence-relations
substitution-method
0
votes
symmetry + transitivity => reflexivity, or not?
answered
Jan 18, 2016
in
Graph Theory
relation
function
Page:
« prev
1
2
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc