Remember
Register
Algorithms Q&A
Smart HR Software
Get the algorithms textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
Recent
Hot!
Most votes
Most answers
Most views
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
Most answered questions
+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
Cost Minimizing Ice Cream Shop
asked
Feb 8, 2018
in
Dynamic Programming
by
luanxy
(
132
points)
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
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
np-completeness
vertex-coloring
satisfiability
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
2
answers
How to generate a random connected graph?
asked
Oct 15, 2017
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
random-graph-generation
+1
vote
2
answers
Calculate g(1000) given the following definition of g function..
asked
Jun 8, 2017
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
+1
vote
2
answers
Given jobs, resources and cost matrix, what assignment minimizes the overall cost?
asked
May 8, 2017
in
Branch & Bound
by
shijie
Active
(
276
points)
job-assignment
+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
+1
vote
2
answers
The lower bound for the Traveling Salesman Problem
asked
Dec 5, 2016
in
Branch & Bound
by
Fangfei
(
204
points)
branchandbound
+1
vote
2
answers
Employee to project assignment reward problem
asked
Dec 4, 2016
in
Branch & Bound
by
Amal_Q
AlgoMeister
(
920
points)
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
2
answers
k-degree constrained spanning tree
asked
Dec 2, 2016
in
NP-Completeness
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
np-completeness
spanning-tree
degree-constrained
+1
vote
2
answers
Topological Sort
asked
Nov 5, 2016
in
Backtracking/DFS/BFS
by
Chetan Mahajan
(
180
points)
dfs
+1
vote
2
answers
MT for T(n) = 2T(n/2) + n^2 log n
asked
Sep 22, 2016
in
Asymptotic Analysis
by
Roc6212
AlgoMeister
(
752
points)
master-theorem
recurrence-relations
+3
votes
2
answers
Recurrence relation : T(n) = T(n/3) + 2 T(2n/3) + n
asked
Sep 15, 2016
in
Asymptotic Analysis
by
panrunyu
AlgoStar
(
380
points)
time-complexity
recurrence-relations
substitution-method
+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
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-notation
small-oh
log
+1
vote
2
answers
Count Primes - Time Complexity
asked
Sep 11, 2016
in
Asymptotic Analysis
by
Shuyue
(
216
points)
time-complexity
asymptotic-notation
prime-numbers
count
+1
vote
2
answers
Order these time complexities from best (lowest) to worst (highest)
asked
Aug 31, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-notation
log
exponent
+1
vote
2
answers
Sum of the Arithmetico-Geometric Progression (AGP)
asked
Aug 30, 2016
in
Math Basics
by
Shuyue
(
216
points)
math
series
Page:
« prev
1
2
3
4
5
6
7
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...