Skip to content

fix typo in chapter 14 figure description of soundness #832

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
adzcai wants to merge 1 commit into
base: master
Choose a base branch
from
Open

fix typo in chapter 14 figure description of soundness #832

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion lec_12_NP.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -665,7 +665,7 @@ This reduction allows to transform a hypothetical polynomial-time algorithm for
![The four components of a reduction, illustrated for the particular reduction of vertex cover to dominating set.
A reduction from problem $F$ to problem $G$ is an algorithm that maps an input $x$ for $F$ into an input $R(x)$ for $G$.
To show that the reduction is correct we need to show the properties of _efficiency_: algorithm $R$ runs in polynomial time,
_completeness_: if $F(x)=1$ then $G(R(x))=1$, and _soundness_: if $F(R(x))=1$ then $G(x)=1$.](../figure/reductionanatomy.png){#reductionanatomyfig}
_completeness_: if $F(x)=1$ then $G(R(x))=1$, and _soundness_: if $G(R(x))=1$ then $F(x)=1$.](../figure/reductionanatomy.png){#reductionanatomyfig}

The reduction of [dominatingsetex](){.ref} gives a good illustration of the anatomy of a reduction.
A reduction consists of four parts:
Expand Down