jfinkels/apxcompleteness

Proof that Maximum 3-Satisfiability is complete for APX under polynomial time AP reductions.

语言：TeX · GitHub 星标：1 · Fork：0

在 GitHub 上查看原仓库