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
+1
vote
4
answers
Solve the recurrence Relation T(n)=T(n/5)+T(7n/10)+(n^2)
asked
Feb 8, 2017
in
Asymptotic Analysis
by
shijie
Active
(
276
points)
recurrence-relations
asymptotic-analysis
time-complexity
+3
votes
1
answer
In Quickselect, T(n)<=T(n/5)+T(7n/10)+cn, prove that T(n) = O(n)
asked
Feb 7, 2017
in
Divide & Conquer
by
Hao Wen
(
212
points)
+1
vote
3
answers
The executive time of program in eclipse seems to be randomly when the times are not very large
asked
Jan 22, 2017
in
Asymptotic Analysis
by
shakexin
(
180
points)
+2
votes
4
answers
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
asked
Dec 14, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
time-complexity
asymptotic-analysis
+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)
+4
votes
4
answers
Rectangles overlap
asked
Dec 4, 2016
in
Divide & Conquer
by
pandeng
(
152
points)
+1
vote
3
answers
Minimizing Weight of a Linear Partition
asked
Nov 20, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
array
dynamic-programming
minimize
+3
votes
3
answers
Finding non-leaf node of a tree with no large subtrees
asked
Nov 5, 2016
in
Backtracking/DFS/BFS
by
Chetan Mahajan
(
180
points)
tree
graph
subtree
+2
votes
1
answer
Heap removing and adding
asked
Oct 6, 2016
in
Graph Theory
by
taoran_xue
AlgoStar
(
440
points)
+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
(
372
points)
time-complexity
recurrence-relations
substitution-method
+2
votes
4
answers
For-While Nested Loops Time Complexity - Inner Loop increments by n^1/3
asked
Sep 15, 2016
in
Asymptotic Analysis
by
WenjunMao
(
140
points)
time-complexity
loops
+1
vote
5
answers
Given f(n) = o(g(n)), prove that 2^f(n) = o(2^g(n))
asked
Sep 12, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
exponent
log
small-oh
asymptotic-notation
+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
Sum of the Arithmetico-Geometric Progression (AGP)
asked
Aug 30, 2016
in
Math Basics
by
Shuyue
(
216
points)
math
series
+4
votes
2
answers
How to find the "joint" median of 3 sorted lists, in less than linear time?
asked
Mar 5, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
median
sorted-lists
+1
vote
3
answers
“Teleportation” across astro-haunted galaxies
asked
Mar 4, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
dynamic-programming
+1
vote
1
answer
Polynomial time solution for Constrained Version of Tetris Problem
asked
Jan 14, 2016
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
tetris
dynamic-programming
Page:
« prev
1
2
3
4
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...