Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
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
(28)
Randomized Algorithms
(1)
Recent questions and answers in NP-Completeness
Most popular tags
asymptotic-analysis
recurrence-relations
time-complexity
loops
asymptotic-notation
graph
dynamic-programming
greedy
substitution-method
analysis
a-star
np-completeness
nested-loops
vertex-coloring
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 and answers in NP-Completeness
+4
votes
4
answers
Long chain of friends
answered
Dec 12, 2023
in
NP-Completeness
by
Manvi
AlgoStar
(
400
points)
np-completeness
0
votes
3
answers
Prove that Sub Graph Isomorphism is Hard
answered
Dec 12, 2023
in
NP-Completeness
by
arsalan
(
132
points)
np-completeness
0
votes
2
answers
k-degree constrained spanning tree
answered
Dec 12, 2023
in
NP-Completeness
by
Manvi
AlgoStar
(
400
points)
np-completeness
spanning-tree
degree-constrained
+1
vote
2
answers
Snow White and 7 Conference Rooms
answered
Dec 19, 2022
in
NP-Completeness
by
Bugao Liang
Active
(
316
points)
np-completeness
reduction
+1
vote
2
answers
What's the time complexity for solving Sudoku with backtrack method?
answered
May 1, 2019
in
NP-Completeness
by
Ruan XiangNing
AlgoMeister
(
948
points)
time-complexity
backtracking
sudoku
0
votes
2
answers
Prove that 3-Coloring is NP Hard (starting with SAT as known NP hard problem)
answered
Dec 2, 2017
in
NP-Completeness
by
benxiaoliu
(
132
points)
np-completeness
vertex-coloring
satisfiability
+2
votes
1
answer
Cook-Levin Theorem
answered
Dec 6, 2016
in
NP-Completeness
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
0
votes
1
answer
Prove that Vertex Cover is NP-hard problem
answered
Nov 22, 2016
in
NP-Completeness
by
Roc6212
AlgoMeister
(
768
points)
np-completeness
reduction
vertex-cover
Help get things started by
asking a question
.
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...