Remember
Register
Algorithms Q&A
Smart HR Software
Get the 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
(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
Recent questions without a selected answer
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
+1
vote
2
answers
Interval Scheduling
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+1
vote
2
answers
Canoeing on the cheap
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
+2
votes
3
answers
Around the block party planning
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
+2
votes
2
answers
Barbie's Array of Diamonds
asked
Mar 3, 2018
in
Dynamic Programming
by
jmlitfi
AlgoMeister
(
684
points)
dynamic-programming
0
votes
2
answers
Cost Minimizing Ice Cream Shop
asked
Feb 8, 2018
in
Dynamic Programming
by
luanxy
(
132
points)
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.5k
points)
np-completeness
vertex-coloring
satisfiability
0
votes
2
answers
Chromatic Number, Relation to Max Degree
asked
Nov 22, 2017
in
Greedy Algorithms
by
Amrinder Arora
AlgoMeister
(
1.5k
points)
graph-coloring
graph
greedy
+1
vote
5
answers
Graph with no 3-clique that needs at least 4 colors
asked
Jul 24, 2017
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.5k
points)
graph
vertex-coloring
0
votes
1
answer
Maximum Value Contiguous Subregion
asked
Jul 23, 2017
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.5k
points)
mvcs
dynamic-programming
+1
vote
3
answers
Three Set Sum: Given an integer k and 3 sets A, B and C, find a, b, c such that a + b + c = k
asked
Jul 23, 2017
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.5k
points)
sorted-lists
searching
+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.5k
points)
recurrence-relations
+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
+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)
Page:
« prev
1
2
3
4
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...