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
0
votes
3
answers
Color this graph (n=10, m=15)
asked
Aug 15, 2016
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
greedy
0
votes
5
answers
Asymptotic Analysis - Triple Loop - k starts from j^2
asked
Jul 2, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-notation
loops
analysis
0
votes
5
answers
Magical eggs and tiny floors
asked
Jun 29, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
dynamic-programming
eggs
floors
+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
+1
vote
3
answers
“Teleportation” across astro-haunted galaxies
asked
Mar 4, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
dynamic-programming
0
votes
1
answer
Adjustment to Greedy Knapsack Algorithm to Guarantee Atleast 50% value of Optimal
asked
Feb 16, 2016
in
Greedy Algorithms
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
greedy
knapsack
0
votes
3
answers
Trichotomy in Context of Asymptotic Functions
asked
Jan 29, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-notation
trichotomy
+1
vote
3
answers
Time Complexity Analysis - Odd Even - Big Jumps
asked
Jan 19, 2016
in
Asymptotic Analysis
by
anonymous
analysis
loops
+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
0
votes
3
answers
symmetry + transitivity => reflexivity, or not?
asked
Jan 18, 2016
in
Graph Theory
by
anonymous
relation
function
0
votes
3
answers
Time Complexity Analysis - Inner loop var gets squared
asked
Jan 15, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
analysis
loops
asymptotic-notation
time-complexity
0
votes
3
answers
Time complexity of GCD algorithm
asked
Jan 14, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
gcd
recursive
+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
...
5
6
7
8
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...