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
2
answers
Maximum Product Spanning Tree
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+1
vote
2
answers
Time Complexity 0.25 * n and k +=k
asked
Mar 4, 2018
in
Asymptotic Analysis
by
jmlitfi
AlgoMeister
(
684
points)
time-complexity
nested-loops
loops
+1
vote
2
answers
Sum of the Arithmetico-Geometric Progression (AGP)
asked
Aug 30, 2016
in
Math Basics
by
Shuyue
(
216
points)
math
series
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
+1
vote
2
answers
The lower bound for the Traveling Salesman Problem
asked
Dec 5, 2016
in
Branch & Bound
by
Fangfei
(
204
points)
branchandbound
+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
+4
votes
4
answers
Long chain of friends
asked
May 6, 2018
in
NP-Completeness
by
zzkaing
Active
(
268
points)
np-completeness
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
4
answers
Compare 2^n^2 and 10^n asymptotically
asked
Sep 10, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-notation
exponent
+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)
+1
vote
1
answer
Time Complexity Analysis - 2 (2nd by log n)
asked
Jan 19, 2016
in
Asymptotic Analysis
by
anonymous
analysis
loops
asymptotic-notation
+1
vote
3
answers
The Subarray with the Minimum Peak
asked
Oct 20, 2018
in
Divide & Conquer
by
irvingzqy
(
148
points)
peak
min-max
+1
vote
3
answers
DNA sequences
asked
Mar 4, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
dynamic-programming
+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
0
votes
3
answers
Graph Example n >= 6, delta >= 4, ki = 2
asked
Aug 20, 2016
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
example
+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
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
2
answers
Topological Sort
asked
Nov 5, 2016
in
Backtracking/DFS/BFS
by
Chetan Mahajan
(
180
points)
dfs
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
+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
5
6
7
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...