Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User amrinderarora
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(38)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(34)
Randomized Algorithms
(1)
Questions by amrinderarora
0
votes
2
answers
k-degree constrained spanning tree
asked
Dec 2, 2016
in
NP-Completeness
np-completeness
spanning-tree
degree-constrained
0
votes
1
answer
Prove that Vertex Cover is NP-hard problem
asked
Nov 20, 2016
in
NP-Completeness
np-completeness
reduction
vertex-cover
+1
vote
3
answers
Minimizing Weight of a Linear Partition
asked
Nov 20, 2016
in
Dynamic Programming
array
dynamic-programming
minimize
+1
vote
5
answers
Given f(n) = o(g(n)), prove that 2^f(n) = o(2^g(n))
asked
Sep 12, 2016
in
Asymptotic Analysis
exponent
log
small-oh
asymptotic-notation
+1
vote
2
answers
Given f(n) = o(g(n)), show that it is not necessary that log (f(n)) = o(log (g(n)))
asked
Sep 12, 2016
in
Asymptotic Analysis
asymptotic-notation
small-oh
log
0
votes
4
answers
Compare 2^n^2 and 10^n asymptotically
asked
Sep 10, 2016
in
Asymptotic Analysis
asymptotic-notation
exponent
+1
vote
2
answers
Order these time complexities from best (lowest) to worst (highest)
asked
Aug 31, 2016
in
Asymptotic Analysis
asymptotic-notation
log
exponent
0
votes
2
answers
Graph that has 10 vertices, is 3-colorable and number of edges is maximized
asked
Aug 23, 2016
in
Graph Theory
graph
vertex-coloring
example
0
votes
3
answers
Graph Example n >= 6, delta >= 4, ki = 2
asked
Aug 20, 2016
in
Graph Theory
graph
vertex-coloring
example
0
votes
2
answers
Time Complexity Analysis - Double Loop - Second increments by 0.01
asked
Aug 20, 2016
in
Asymptotic Analysis
time-complexity
asymptotic-notation
loops
analysis
0
votes
3
answers
Color this graph (n=10, m=15)
asked
Aug 15, 2016
in
Graph Theory
graph
vertex-coloring
greedy
0
votes
5
answers
Asymptotic Analysis - Triple Loop - k starts from j^2
asked
Jul 2, 2016
in
Asymptotic Analysis
asymptotic-notation
loops
analysis
0
votes
5
answers
Magical eggs and tiny floors
asked
Jun 29, 2016
in
Dynamic Programming
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
median
sorted-lists
+1
vote
3
answers
“Teleportation” across astro-haunted galaxies
asked
Mar 4, 2016
in
Dynamic Programming
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
greedy
knapsack
0
votes
3
answers
Trichotomy in Context of Asymptotic Functions
asked
Jan 29, 2016
in
Asymptotic Analysis
asymptotic-notation
trichotomy
0
votes
3
answers
Time Complexity Analysis - Inner loop var gets squared
asked
Jan 15, 2016
in
Asymptotic Analysis
analysis
loops
asymptotic-notation
time-complexity
0
votes
3
answers
Time complexity of GCD algorithm
asked
Jan 14, 2016
in
Asymptotic Analysis
gcd
recursive
+1
vote
1
answer
Polynomial time solution for Constrained Version of Tetris Problem
asked
Jan 14, 2016
in
Graph Theory
tetris
dynamic-programming
Page:
« prev
1
2
3
4
5
...