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
Hot questions
0
votes
3
answers
Prove that Sub Graph Isomorphism is Hard
asked
Dec 20, 2019
in
NP-Completeness
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
np-completeness
0
votes
2
answers
Solving this recurrence relation: T(n) = 2 T(n/2) + f(n)
asked
Sep 24, 2019
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
0
votes
2
answers
How can we solve the 8 puzzle problem using Branch & Bound approach?
asked
Apr 9, 2019
in
Branch & Bound
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
n-puzzle
a-star
+1
vote
2
answers
Maximize value of coins from k stacks, of n coins each
asked
Apr 9, 2019
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
coins
+1
vote
2
answers
Give an example of a graph without an articulation point, a Hamiltonian cycle, or a 2-coloring
asked
Jul 8, 2018
in
Graph Theory
by
basil
Active
(
340
points)
graph
vertex-coloring
graph-coloring
0
votes
2
answers
Randomized Algorithm - Basics (4 Questions in 1)
asked
Sep 12, 2018
in
Randomized Algorithms
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
randomized
asymptotic-analysis
+1
vote
4
answers
outer loop until log n, inner loop exponential increase
asked
Jul 8, 2018
in
Asymptotic Analysis
by
basil
Active
(
340
points)
time-complexity
asymptotic-analysis
+1
vote
1
answer
Algorithm for Power Plant CSP
asked
Mar 24, 2021
in
CSP
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
csp
+4
votes
4
answers
Long chain of friends
asked
May 6, 2018
in
NP-Completeness
by
zzkaing
Active
(
268
points)
np-completeness
0
votes
1
answer
Jumpy Car - Estimate/Solve the V* values for the following MDP
asked
Mar 1, 2021
in
MDP
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
mdp
stochastic
markov-model
+1
vote
2
answers
Maximum Product Spanning Tree
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
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
+1
vote
3
answers
DNA sequences
asked
Mar 4, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
dynamic-programming
0
votes
4
answers
Is Greed the best choice?
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
0
votes
3
answers
Symbol Frequency
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+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
Maximum Spanning Tree
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
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
+1
vote
5
answers
Graph with no 3-clique that needs at least 4 colors
asked
Jul 24, 2017
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
Page:
« prev
1
2
3
4
5
6
...
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...