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
Hot questions
0
votes
4
answers
1-D k-means clustering
asked
Mar 8, 2018
in
Dynamic Programming
by
duankebo
(
116
points)
+1
vote
2
answers
Canoeing on the cheap
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
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
Time Complexity (3 loops with gcd)
asked
Mar 4, 2018
in
Asymptotic Analysis
by
jmlitfi
AlgoMeister
(
684
points)
loops
nested-loops
gcd
easy
+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)
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
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
Time Complexity increasing by n^(1/3)log(n)
asked
Mar 4, 2018
in
Asymptotic Analysis
by
jmlitfi
AlgoMeister
(
684
points)
time-complexity
+1
vote
2
answers
The lower bound for the Traveling Salesman Problem
asked
Dec 5, 2016
in
Branch & Bound
by
Fangfei
(
204
points)
branchandbound
0
votes
2
answers
Prove that 3-Coloring is NP Hard (starting with SAT as known NP hard problem)
asked
Nov 29, 2017
in
NP-Completeness
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
np-completeness
vertex-coloring
satisfiability
+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
+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
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
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
+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
+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
+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
+4
votes
1
answer
Maximum Value But Limited Neighbors
asked
Jun 20, 2017
in
Dynamic Programming
by
Baijun Xie
AlgoStar
(
416
points)
+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
Page:
« prev
1
...
3
4
5
6
7
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...