bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Remove extra citations

This commit is contained in:
Antti H S Laaksonen 2017-02-22 21:44:42 +02:00
parent 2784ffa5ee
commit b12d09ee6c
2 changed files with 3 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
chapter12.tex
View File

@ -546,4 +546,4 @@ it is difficult to find out if the nodes
in a graph can be colored using $k$ colors in a graph can be colored using $k$ colors
so that no adjacent nodes have the same color. so that no adjacent nodes have the same color.
Even when $k=3$, no efficient algorithm is known Even when $k=3$, no efficient algorithm is known
but the problem is NP-hard \cite{gar79}. but the problem is NP-hard.

8
chapter17.tex
View File

@ -559,9 +559,5 @@ and both $x_i$ and $x_j$ become false.
A more difficult problem is the \key{3SAT problem} A more difficult problem is the \key{3SAT problem}
where each part of the formula is of the form where each part of the formula is of the form
$(a_i \lor b_i \lor c_i)$. $(a_i \lor b_i \lor c_i)$.
This problem is NP-hard \cite{gar79}, so no efficient algorithm This problem is NP-hard, so no efficient algorithm
for solving the problem is known. for solving the problem is known.