Remember
Register
Algorithms Q&A
Smart HCM Software
Get the course textbook
Questions
Unanswered
Ask a Question
Lecture Notes
Not Exponential, on Twitter
All categories
Asymptotic Analysis
(22)
Divide & Conquer
(9)
Greedy Algorithms
(2)
Dynamic Programming
(7)
Backtracking/DFS/BFS
(2)
Branch & Bound
(2)
Graph Theory
(15)
NPCompleteness
(4)
Recent questions and answers in NPCompleteness
Most popular tags
timecomplexity
asymptoticnotation
recurrencerelations
loops
graph
asymptoticanalysis
dynamicprogramming
analysis
vertexcoloring
greedy
log
exponent
mvcs
npcompleteness
mastertheorem
smalloh
nestedloops
sortedlists
example
recursive
graphcoloring
randomgraphgeneration
proxy
network
substitutionmethod
branchandbound
d&c
degreeconstrained
spanningtree
vertexcover
reduction
dfs
subtree
primenumbers
sqrt
lecture1
math
tree
count
minimize
floors
array
median
knapsack
trichotomy
eggs
searching
function
relation
gcd
tetris
Recent questions and answers in NPCompleteness
+1
vote
0
answers
What's the time complexity for solving Sudoku with backtrace method?
asked
Apr 28
in
NPCompleteness
by
shijie
Active
(
276
points)
timecomplexity
+2
votes
1
answer
CookLevin Theorem
answered
Dec 6, 2016
in
NPCompleteness
by
Amrinder Arora
(
206
points)
0
votes
1
answer
kdegree constrained spanning tree
answered
Dec 2, 2016
in
NPCompleteness
by
Amal_Q
AlgoMeister
(
1,084
points)
npcompleteness
spanningtree
degreeconstrained
0
votes
1
answer
Prove that Vertex Cover is NPhard problem
answered
Nov 22, 2016
in
NPCompleteness
by
Roc6212
AlgoMeister
(
748
points)
npcompleteness
reduction
vertexcover
Help get things started by
asking a question
.
The Book: Analysis and Design of Algorithms

Presentations on Slideshare

Lecture Notes, etc
...