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)
Questions by Amrinder Arora
0
votes
1
answer
In the context of informed search, what is the difference between complete, optimal and optimally efficient algorithm?
asked
Mar 18, 2018
in
Informed Search
a-star
0
votes
1
answer
N-Queens Count all conflicts in O(n) time
asked
Mar 2, 2018
in
Informed Search
n-queens
ai
count
conflict
0
votes
2
answers
Prove that 3-Coloring is NP Hard (starting with SAT as known NP hard problem)
asked
Nov 29, 2017
in
NP-Completeness
np-completeness
vertex-coloring
satisfiability
0
votes
2
answers
Chromatic Number, Relation to Max Degree
asked
Nov 22, 2017
in
Greedy Algorithms
graph-coloring
graph
greedy
0
votes
2
answers
How to generate a random connected graph?
asked
Oct 15, 2017
in
Graph Theory
graph
random-graph-generation
+1
vote
5
answers
Graph with no 3-clique that needs at least 4 colors
asked
Jul 24, 2017
in
Graph Theory
graph
vertex-coloring
0
votes
1
answer
Maximum Value Contiguous Subregion
asked
Jul 23, 2017
in
Dynamic Programming
mvcs
dynamic-programming
+1
vote
3
answers
Three Set Sum: Given an integer k and 3 sets A, B and C, find a, b, c such that a + b + c = k
asked
Jul 23, 2017
in
Divide & Conquer
sorted-lists
searching
+1
vote
2
answers
Calculate g(1000) given the following definition of g function..
asked
Jun 8, 2017
in
Dynamic Programming
recurrence-relations
+10
votes
3
answers
Solve the recurrence relation: T(n)=T(n/2)+T(n/3)+T(n/4) + n
asked
Feb 14, 2017
in
Divide & Conquer
asymptotic-analysis
recurrence-relations
time-complexity
substitution-method
+2
votes
4
answers
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
asked
Dec 14, 2016
in
Divide & Conquer
recurrence-relations
time-complexity
asymptotic-analysis
+1
vote
3
answers
Solve the recurrence Relation: T(n) = T(n/3) + T(2n/3) + n
asked
Dec 14, 2016
in
Divide & Conquer
recurrence-relations
substitution-method
asymptotic-analysis
+1
vote
1
answer
MVCS using Divide and Conquer
asked
Dec 3, 2016
in
Divide & Conquer
mvcs
d&c
0
votes
2
answers
Make change using smallest number of coins of given denominations
asked
Dec 3, 2016
in
Dynamic Programming
dynamic-programming
0
votes
2
answers
k-degree constrained spanning tree
asked
Dec 2, 2016
in
NP-Completeness
np-completeness
spanning-tree
degree-constrained
0
votes
1
answer
Prove that Vertex Cover is NP-hard problem
asked
Nov 20, 2016
in
NP-Completeness
np-completeness
reduction
vertex-cover
+1
vote
3
answers
Minimizing Weight of a Linear Partition
asked
Nov 20, 2016
in
Dynamic Programming
array
dynamic-programming
minimize
+1
vote
5
answers
Given f(n) = o(g(n)), prove that 2^f(n) = o(2^g(n))
asked
Sep 12, 2016
in
Asymptotic Analysis
exponent
log
small-oh
asymptotic-notation
+1
vote
2
answers
Given f(n) = o(g(n)), show that it is not necessary that log (f(n)) = o(log (g(n)))
asked
Sep 12, 2016
in
Asymptotic Analysis
asymptotic-notation
small-oh
log
0
votes
4
answers
Compare 2^n^2 and 10^n asymptotically
asked
Sep 10, 2016
in
Asymptotic Analysis
asymptotic-notation
exponent
Page:
« prev
1
2
3
4
5
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc