Remember
Register
Algorithms Q&A
Nobel Prize in Economics
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
(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)
Most popular tags
asymptotic-analysis
recurrence-relations
time-complexity
loops
asymptotic-notation
graph
dynamic-programming
greedy
substitution-method
analysis
a-star
np-completeness
nested-loops
vertex-coloring
mdp
log
probability
stochastic
heuristic
master-theorem
markov-model
n-puzzle
csp
graph-coloring
exam
mvcs
small-oh
exponent
proof
viterbi
bayes-rule
hmm
tree-search
grid-world
admissible
n-queens
conflict
ai
clique
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 a selected answer
0
votes
7
answers
Solve this recurrence relation: T(n) = T(n-1) + T(n/2) + 1
asked
Jun 13, 2020
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
substitution-method
0
votes
2
answers
Highest sum of tree heights when one recoloring is allowed
asked
May 5, 2020
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
loops
0
votes
1
answer
Stationary Distribution for this conditional probability table
asked
Apr 4, 2020
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
markov-model
0
votes
2
answers
What is the code level difference between graph search and tree search?
asked
Feb 3, 2020
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph-search
tree-search
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
Solve this GridWorld
asked
May 13, 2019
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
grid-world
0
votes
1
answer
Admissible Heuristic for n-puzzle if multiple tiles can be slided at once
asked
May 7, 2019
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
n-puzzle
a-star
heuristic
+1
vote
1
answer
8 puzzle that can be solved or not?
asked
Apr 30, 2019
in
Informed Search
by
Ruan XiangNing
AlgoMeister
(
964
points)
n-puzzle
+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
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
0
votes
8
answers
Gold is a precious metal
asked
Mar 29, 2019
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
maximize-value
gold
0
votes
2
answers
Give an example of a task environment that is..
asked
Jan 25, 2019
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
task-environments
+1
vote
3
answers
The Subarray with the Minimum Peak
asked
Oct 20, 2018
in
Divide & Conquer
by
irvingzqy
(
148
points)
peak
min-max
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
+4
votes
4
answers
Long chain of friends
asked
May 6, 2018
in
NP-Completeness
by
zzkaing
Active
(
268
points)
np-completeness
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
3
answers
Admissible Heuristic for n-Queens Problem
asked
Mar 24, 2018
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
n-queens
conflict
ai
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
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
a-star
Page:
« prev
1
2
3
4
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...