Remember
Register
Algorithms Q&A
Nobel Prize in Economics
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
(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)
Recent questions
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
+3
votes
1
answer
log(n!) = Theta(nlogn)
asked
May 9, 2017
in
Asymptotic Analysis
by
shakexin
(
180
points)
asymptotic-notation
+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
+1
vote
2
answers
What's the time complexity for solving Sudoku with backtrack method?
asked
Apr 28, 2017
in
NP-Completeness
by
shijie
Active
(
276
points)
time-complexity
backtracking
sudoku
+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)
+2
votes
1
answer
How to get the time complexity of these algorithms, in terms of n in quiz 2?
asked
Feb 18, 2017
in
Asymptotic Analysis
by
liyanbo
(
176
points)
+10
votes
3
answers
Solve the recurrence relation: T(n)=T(n/2)+T(n/3)+T(n/4) + n
asked
Feb 14, 2017
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-analysis
recurrence-relations
time-complexity
substitution-method
+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
3
answers
Solve the recurrence Relation: T(n) = T(n/3) + T(2n/3) + n
asked
Dec 14, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
substitution-method
asymptotic-analysis
+2
votes
1
answer
Cook-Levin Theorem
asked
Dec 6, 2016
in
NP-Completeness
by
Roc6212
AlgoMeister
(
768
points)
+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)
+2
votes
1
answer
Loop i through log n incremented by constant multiplication
asked
Dec 4, 2016
in
Asymptotic Analysis
by
abdulgood89
AlgoStar
(
416
points)
loops
while-loop
logn
easy
+1
vote
1
answer
MVCS using Divide and Conquer
asked
Dec 3, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
mvcs
d&c
0
votes
2
answers
Make change using smallest number of coins of given denominations
asked
Dec 3, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
dynamic-programming
0
votes
2
answers
k-degree constrained spanning tree
asked
Dec 2, 2016
in
NP-Completeness
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
np-completeness
spanning-tree
degree-constrained
0
votes
1
answer
Prove that Vertex Cover is NP-hard problem
asked
Nov 20, 2016
in
NP-Completeness
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
np-completeness
reduction
vertex-cover
Page:
« prev
1
...
3
4
5
6
7
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...