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
(37)
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
recurrence-relations
time-complexity
asymptotic-analysis
loops
graph
asymptotic-notation
dynamic-programming
greedy
substitution-method
a-star
np-completeness
nested-loops
vertex-coloring
analysis
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
+1
vote
3
answers
The Subarray with the Minimum Peak
asked
Oct 20, 2018
in
Divide & Conquer
by
irvingzqy
(
148
points)
peak
min-max
0
votes
1
answer
Find the smallest domain value where the function becomes negative.
asked
Sep 26, 2018
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
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
+1
vote
2
answers
Give an example of a graph without an articulation point, a Hamiltonian cycle, or a 2-coloring
asked
Jul 8, 2018
in
Graph Theory
by
basil
Active
(
340
points)
graph
vertex-coloring
graph-coloring
+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
1
answer
Solve the Recurrence Relation: T(n) = T(n/4) + T(3n/4) + n^2
asked
May 7, 2018
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
time-complexity
substitution-method
+4
votes
4
answers
Long chain of friends
asked
May 6, 2018
in
NP-Completeness
by
zzkaing
Active
(
268
points)
np-completeness
0
votes
2
answers
You are given a Boolean formula involving variables X1, X2, ... Xn.
asked
Apr 13, 2018
in
Branch & Bound
by
zzkaing
Active
(
268
points)
branch
and
bound
0
votes
3
answers
Admissible Heuristic for n-Queens Problem
asked
Mar 24, 2018
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
n-queens
conflict
ai
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
4
answers
1-D k-means clustering
asked
Mar 8, 2018
in
Dynamic Programming
by
duankebo
(
116
points)
+1
vote
3
answers
DNA sequences
asked
Mar 4, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
dynamic-programming
+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
+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
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
4
answers
Is Greed the best choice?
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
0
votes
3
answers
Symbol Frequency
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+1
vote
2
answers
Maximize Party Planning Reward
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+1
vote
2
answers
Maximum Product Spanning Tree
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
0
votes
2
answers
Maximum Spanning Tree
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
Page:
« prev
1
2
3
4
5
6
7
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...