Remember
Register
Algorithms Q&A
Smart HCM Software
Get the course textbook
Questions
Unanswered
Ask a Question
Lecture Notes
Recent
Hot!
Most votes
Most answers
Most views
Not Exponential, on Twitter
All categories
Asymptotic Analysis
(22)
Divide & Conquer
(9)
Greedy Algorithms
(2)
Dynamic Programming
(8)
Backtracking/DFS/BFS
(2)
Branch & Bound
(2)
Graph Theory
(15)
NPCompleteness
(6)
Recent questions
Most popular tags
timecomplexity
asymptoticnotation
recurrencerelations
loops
graph
asymptoticanalysis
dynamicprogramming
vertexcoloring
analysis
npcompleteness
greedy
log
exponent
mvcs
vertexcover
mastertheorem
smalloh
nestedloops
sortedlists
example
recursive
satisfiability
graphcoloring
randomgraphgeneration
proxy
network
substitutionmethod
branchandbound
d&c
degreeconstrained
spanningtree
reduction
dfs
subtree
primenumbers
sqrt
lecture1
math
tree
count
minimize
floors
array
median
knapsack
trichotomy
eggs
searching
function
relation
gcd
tetris
Recent questions
0
votes
1
answer
Cost Minimizing Ice Cream Shop
asked
Feb 8
in
Dynamic Programming
by
luanxy
(
132
points)
0
votes
0
answers
Prove NPcomplete: Given a graph G, integer k, find whether or not graph G has a spanning degree == k.
asked
Dec 2, 2017
in
NPCompleteness
by
michael5486
(
132
points)
npcompleteness
vertexcover
0
votes
2
answers
Prove that 3Coloring is NP Hard (starting with SAT as known NP hard problem)
asked
Nov 29, 2017
in
NPCompleteness
by
Amrinder Arora
(
230
points)
npcompleteness
vertexcoloring
satisfiability
0
votes
0
answers
Chromatic Number, Relation to Max Degree
asked
Nov 22, 2017
in
Greedy Algorithms
by
Amrinder Arora
(
230
points)
graphcoloring
graph
greedy
0
votes
2
answers
How to generate a random connected graph?
asked
Oct 15, 2017
in
Graph Theory
by
Amrinder Arora
(
230
points)
graph
randomgraphgeneration
0
votes
1
answer
What's the time complexity when j increases by j += log(j+5)?
asked
Sep 10, 2017
in
Asymptotic Analysis
by
Yan Zhang
(
132
points)
loops
log
0
votes
0
answers
Graph with no 3clique that needs at least 4 colors
asked
Jul 24, 2017
in
Graph Theory
by
Amrinder Arora
(
230
points)
graph
vertexcoloring
0
votes
0
answers
Maximum Value Contiguous Subregion
asked
Jul 23, 2017
in
Dynamic Programming
by
Amrinder Arora
(
230
points)
mvcs
dynamicprogramming
0
votes
1
answer
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
(
230
points)
sortedlists
searching
+1
vote
1
answer
"Fast Response" Locating a Proxy Server for the network
asked
Jul 12, 2017
in
Greedy Algorithms
by
Baijun Xie
AlgoStar
(
400
points)
proxy
network
greedy
+1
vote
1
answer
Time Complexity Analysis  Nested Loops  Inner Increments by sqrt(k)
asked
Jul 12, 2017
in
Asymptotic Analysis
by
Baijun Xie
AlgoStar
(
400
points)
timecomplexity
nestedloops
sqrt
+2
votes
1
answer
Maximum Value But Limited Neighbors
asked
Jun 20, 2017
in
Dynamic Programming
by
Baijun Xie
AlgoStar
(
400
points)
+1
vote
2
answers
Calculate g(1000) given the following definition of g function..
asked
Jun 8, 2017
in
Dynamic Programming
by
Amrinder Arora
(
230
points)
recurrencerelations
+3
votes
1
answer
log(n!) = Theta(nlogn)
asked
May 9, 2017
in
Asymptotic Analysis
by
shakexin
(
180
points)
asymptoticnotation
+1
vote
0
answers
What's the time complexity for solving Sudoku with backtrace method?
asked
Apr 28, 2017
in
NPCompleteness
by
shijie
Active
(
276
points)
timecomplexity
+3
votes
1
answer
Solve the recurrence relation: T(n)=T(n/2)+T(n^0.5)+n
asked
Mar 2, 2017
in
Asymptotic Analysis
by
shijie
Active
(
276
points)
+2
votes
1
answer
How to get the time complexity of these algorithms, in terms of n in quiz 2?
asked
Feb 18, 2017
in
Asymptotic Analysis
by
liyanbo
Active
(
312
points)
+8
votes
4
answers
Solve the recurrence relation: T(n)=T(n/2)+T(n/3)+T(n/4) + n
asked
Feb 14, 2017
in
Divide & Conquer
by
Amrinder Arora
(
230
points)
asymptoticanalysis
recurrencerelations
timecomplexity
+1
vote
1
answer
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)
recurrencerelations
asymptoticanalysis
timecomplexity
+1
vote
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
(
196
points)
Page:
1
2
3
4
next »
The Book: Analysis and Design of Algorithms

Presentations on Slideshare

Lecture Notes, etc
...