问题标签 [computability]
For questions regarding programming in ECMAScript (JavaScript/JS) and its various dialects/implementations (excluding ActionScript). Note JavaScript is NOT the same as Java! Please include all relevant tags on your question; e.g., [node.js], [jquery], [json], [reactjs], [angular], [ember.js], [vue.js], [typescript], [svelte], etc.
81 问题
0
投票
1
回答
40
浏览
graph-theory - 假设 P = NP
假设 P = NP，这是否意味着哈密顿循环不再是 NP-Hard？Hamiltonian-Cycle 是一种语言，其中给定的图 G 包含一个 Ham-Cycle。