Complexity of hierarchically and 1-dimensional periodically specified problemsMadhav Marathe,Harry B Hunt,Richard E Stearns,Venkatesh Radhakrishnanmag（1995）引用 27|浏览10暂无评分关键词satisfiability,set theory,polynomials,polynomial time,algorithms,1 dimensional,boundary conditionAI 理解论文溯源树样例生成溯源树，研究论文发展脉络Chat Paper正在生成论文摘要
