Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
aa:lab:8 [2023/12/03 00:40] stefan.sterea |
aa:lab:8 [2024/11/28 18:13] (current) lfa |
||
|---|---|---|---|
| Line 11: | Line 11: | ||
| * $ {\rm Partioning} \le_p {\rm SubsetSum}$ | * $ {\rm Partioning} \le_p {\rm SubsetSum}$ | ||
| * $ {\rm SubsetSum} \le_p {\rm Partioning}$ | * $ {\rm SubsetSum} \le_p {\rm Partioning}$ | ||
| - | * $ {\rm HamiltonianCycle} \le_p {\rm HamiltonianPath} | + | * $ {\rm HamiltonianCycle} \le_p {\rm HamiltonianPath}$ |
| - | * x | + | * $ {\rm GraphUnreachability} \le_p {\rm 2SAT}$ unde $ {\rm GraphUnreachability}$ intreaba daca NU exista nici un drum intre doua noduri $ s$ si $ t$ intr-un graf $ G$ |
| * $ {\rm 3SAT} \le_p {\rm kVertexCover}$ | * $ {\rm 3SAT} \le_p {\rm kVertexCover}$ | ||
| + | |||
| + | <note> | ||
| + | Soluțiile acestui laborator se găsesc [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:sol:7|aici]] | ||
| + | </note> | ||