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
0
votes
1
answer
Solve this recurrence relation: T(n) = T(n/3) + T(n/5) + T(n/6) + n
asked
Sep 19, 2019
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
time-complexity
substitution-method
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
0
votes
1
answer
Show that Greedy Algorithm is suboptimal for Gold Rod Question
asked
May 4, 2019
in
Greedy Algorithms
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
greedy-suboptimal
+1
vote
1
answer
8 puzzle that can be solved or not?
asked
Apr 30, 2019
in
Informed Search
by
Ruan XiangNing
AlgoMeister
(
968
points)
n-puzzle
0
votes
1
answer
Is Harmonic Mean of admissible heuristics an admissible heuristic?
asked
Apr 8, 2019
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
admissible
heuristic
a-star
0
votes
1
answer
Converting ternary constraint into binary constraints
asked
Feb 9, 2019
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
constraint-satisfaction-problem
csp
0
votes
1
answer
Manhattan Distances, but Linear Interference...
asked
Feb 2, 2019
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
8-puzzle
heuristic
a-star
0
votes
1
answer
Find the smallest domain value where the function becomes negative.
asked
Sep 26, 2018
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
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
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
+3
votes
1
answer
Time Complexity (3 loops with gcd)
asked
Mar 4, 2018
in
Asymptotic Analysis
by
jmlitfi
AlgoMeister
(
684
points)
loops
nested-loops
gcd
easy
0
votes
1
answer
Time Complexity increasing by n^(1/3)log(n)
asked
Mar 4, 2018
in
Asymptotic Analysis
by
jmlitfi
AlgoMeister
(
684
points)
time-complexity
0
votes
1
answer
N-Queens Count all conflicts in O(n) time
asked
Mar 2, 2018
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
n-queens
ai
count
conflict
0
votes
1
answer
What's the time complexity when j increases by j += log(j+5)?
asked
Sep 10, 2017
in
Asymptotic Analysis
by
Yan Zhang
(
132
points)
loops
log
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
1
answer
"Fast Response" Locating a Proxy Server for the network
asked
Jul 12, 2017
in
Greedy Algorithms
by
Baijun Xie
AlgoStar
(
416
points)
proxy
network
greedy
+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
+4
votes
1
answer
Maximum Value But Limited Neighbors
asked
Jun 20, 2017
in
Dynamic Programming
by
Baijun Xie
AlgoStar
(
416
points)
+3
votes
1
answer
log(n!) = Theta(nlogn)
asked
May 9, 2017
in
Asymptotic Analysis
by
shakexin
(
180
points)
asymptotic-notation
+3
votes
1
answer
Solve the recurrence relation: T(n)=T(n/2)+T(n^0.5)+n
asked
Mar 2, 2017
in
Asymptotic Analysis
by
shijie
Active
(
276
points)
Page:
« prev
1
...
4
5
6
7
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...