Remember
Register
Algorithms Q&A
Smart HR Software
Get the algorithms textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
No answer
No selected answer
No upvoted answer
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(36)
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)
Most popular tags
recurrence-relations
time-complexity
asymptotic-analysis
loops
graph
dynamic-programming
asymptotic-notation
greedy
substitution-method
a-star
np-completeness
nested-loops
vertex-coloring
mdp
log
analysis
probability
stochastic
heuristic
master-theorem
markov-model
n-puzzle
csp
graph-coloring
mvcs
small-oh
exponent
proof
viterbi
bayes-rule
hmm
tree-search
grid-world
admissible
n-queens
conflict
ai
clique
exam
coins
reduction
dfs
prime-numbers
sqrt
count
easy
sorted-lists
logn
example
recursive
gcd
independent-set
unsolvable
pcp
counter-example
not-master-theorem
modulus
algebra
most-likely-estimate
reinforcement-learning
direct-evaluation
meu
articulation-point
hotel-room
small-omega
limit-method
mle
graph-search
while-loop
greedy-suboptimal
job-assignment
maximize-value
gold
constraint-satisfaction-problem
8-puzzle
task-environments
min-max
peak
randomized
satisfiability
random-graph-generation
proxy
network
sudoku
branchandbound
d&c
degree-constrained
spanning-tree
vertex-cover
branch
subtree
series
pmi
bound
contradiction
math
backtracking
tree
minimize
floors
Recent questions without an upvoted answer
0
votes
1
answer
Solve the Recurrence Relation: T(n) = T(n/4) + T(3n/4) + n^2
asked
May 7, 2018
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
time-complexity
substitution-method
0
votes
2
answers
You are given a Boolean formula involving variables X1, X2, ... Xn.
asked
Apr 13, 2018
in
Branch & Bound
by
zzkaing
Active
(
268
points)
branch
and
bound
0
votes
4
answers
1-D k-means clustering
asked
Mar 8, 2018
in
Dynamic Programming
by
duankebo
(
116
points)
0
votes
4
answers
Is Greed the best choice?
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
0
votes
3
answers
Symbol Frequency
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+1
vote
2
answers
Maximize Party Planning Reward
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
0
votes
2
answers
Maximum Spanning Tree
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+1
vote
2
answers
Interval Scheduling
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+1
vote
2
answers
Canoeing on the cheap
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
+2
votes
2
answers
Barbie's Array of Diamonds
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
dynamic-programming
0
votes
2
answers
Chromatic Number, Relation to Max Degree
asked
Nov 22, 2017
in
Greedy Algorithms
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph-coloring
graph
greedy
0
votes
1
answer
Maximum Value Contiguous Subregion
asked
Jul 23, 2017
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
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
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
sorted-lists
searching
+1
vote
1
answer
Time Complexity Analysis - Nested Loops - Inner Increments by sqrt(k)
asked
Jul 12, 2017
in
Asymptotic Analysis
by
Baijun Xie
AlgoStar
(
416
points)
time-complexity
nested-loops
sqrt
+1
vote
2
answers
What's the time complexity for solving Sudoku with backtrack method?
asked
Apr 28, 2017
in
NP-Completeness
by
shijie
Active
(
276
points)
time-complexity
backtracking
sudoku
+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
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
time-complexity
asymptotic-analysis
+1
vote
1
answer
MVCS using Divide and Conquer
asked
Dec 3, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
mvcs
d&c
0
votes
2
answers
Make change using smallest number of coins of given denominations
asked
Dec 3, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
dynamic-programming
0
votes
3
answers
Prove Ө(log 1 + log2 + log3 + log4 +... + logn) = Ө(n log n)
asked
Sep 15, 2016
in
Asymptotic Analysis
by
Roc6212
AlgoMeister
(
752
points)
log
+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
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
exponent
log
small-oh
asymptotic-notation
Page:
« prev
1
2
3
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...