正在加载图片...
Solvable V.S.Verifiable For a problem in P,we have polynomial time algorithm to solve it For a problem in NP,we have polynomial time verification algorithm to verify a certificate 9Solvable V.S. Verifiable • For a problem in P, we have polynomial time algorithm to solve it • For a problem in NP, we have polynomial time verification algorithm to verify a certificate 9
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有