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 viewed questions
+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
0
votes
6
answers
N-th power of complex number z = x + iy in O(log n) time
asked
Jun 13, 2020
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
logn
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
6
answers
Solve this recurrence relation: T(n) = 3 T(n/4) + O(n^0.75)
asked
Jun 13, 2020
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
substitution-method
master-theorem
+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
+2
votes
1
answer
Heap removing and adding
asked
Oct 6, 2016
in
Graph Theory
by
taoran_xue
AlgoStar
(
440
points)
+1
vote
2
answers
Maximize Party Planning Reward
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
0
votes
1
answer
Tree method or PMI?
asked
Sep 28, 2016
in
Divide & Conquer
by
taoran_xue
AlgoStar
(
440
points)
recurrence-relations
+1
vote
3
answers
Love (Skip) thy neighbor
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
dynamic-programming
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
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
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
3
answers
Solve or estimate this recurrence relation T(n) = 2 T(n/3) + T(n/2) + n
asked
Jun 1, 2021
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
not-master-theorem
0
votes
5
answers
"SpicyBitter" Sequence of Sauces
asked
Jun 16, 2020
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
+2
votes
3
answers
Around the block party planning
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
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
+2
votes
2
answers
If you are happy and you know it, jump up high!
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
dynamic-programming
0
votes
4
answers
1-D k-means clustering
asked
Mar 8, 2018
in
Dynamic Programming
by
duankebo
(
116
points)
+1
vote
2
answers
Interval Scheduling
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+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
Page:
« prev
1
2
3
4
5
6
7
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...