An algorithm in finding minimal reduction based on Propositional Satisfiability(abbreviated as SAT) algorithm is proposed.A branch and bound algorithm is presented to solve the proposed SAT problem.是什么意思_An algorithm in finding minimal reduction based on Propositional Satisfiability(abbreviated as SAT) algorithm is proposed.A branch and bound algorithm is presented to solve the proposed SAT problem.在線(xiàn)翻譯_英語(yǔ)_讀音_用法_例句