A Short Implicant of CNFs with Relatively Many Satisfying Assignments.Daniel M. Kane,Osamu WatanabeElectronic Colloquium on Computational Complexity (ECCC)(2013)引用 23|浏览19暂无评分AI 理解论文溯源树样例生成溯源树,研究论文发展脉络Chat Paper正在生成论文摘要