各位同學，期末考有二題，請在 5/24 星期一中午以前交到林耀鈴老師系辦公室信箱。

Problem 1:
    Derive a polynomial deterministic time algorithm for solveing the 2-CNF-SAT problem.
    -- from: old book (1990 version 1): page 946, 36.4-7
    -- or new book (2001 version 2): page 1003, 34.4-7

Problem 2:
    Prove that 0-1 integer programming problem is NP-complete by reduction from 3-CNF-SAT problem.
    -- from: old book (1990 version 1): page 960, 36.5-2
    -- or new book (2001 version 2): page 1017, 34.5-3