中国
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
完整文章
类别
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
你写
用户
登录
登记
找回密码
标签
语言标签
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
标签reductions - 这是页10 - GeneraCodice
整数线性程序的NP完整性
https://www.generacodice.com/cn/articolo/2444160/整数线性程序的np完整性
np-complete
-
reductions
-
decision-problem
cs.stackexchange
证明机器人交易者问题是np-complete
https://www.generacodice.com/cn/articolo/2443926/证明机器人交易者问题是np-complete
complexity-theory
-
np-complete
-
reductions
cs.stackexchange
哈密顿周期,验证和发现
https://www.generacodice.com/cn/articolo/2442702/哈密顿周期-验证和发现
complexity-theory
-
reductions
-
hamiltonian-path
cs.stackexchange
从顶点盖减少到主导集合
https://www.generacodice.com/cn/articolo/2441622/从顶点盖减少到主导集合
np-hard
-
correctness-proof
-
reductions
-
polynomial-time-reductions
cs.stackexchange
Example of two undecidable languages that cannot be reduced to each other
https://www.generacodice.com/cn/articolo/1811059/example-of-two-undecidable-languages-that-cannot-be-reduced-to-each-other
turing-machines
-
automata
-
formal-languages
-
reductions
cs.stackexchange
How do we construct reductions for NP-Completeness
https://www.generacodice.com/cn/articolo/1810826/how-do-we-construct-reductions-for-np-completeness
np-complete
-
reductions
cs.stackexchange
Is finding the minimum feedback arc set on graph with two outgoing arcs for each node np-complete?
https://www.generacodice.com/cn/articolo/1810460/is-finding-the-minimum-feedback-arc-set-on-graph-with-two-outgoing-arcs-for-each-node-np-complete
complexity-theory
-
np-complete
-
reductions
cs.stackexchange
Reductions from non decision problems
https://www.generacodice.com/cn/articolo/1810070/reductions-from-non-decision-problems
complexity-theory
-
np-complete
-
computability
-
approximation
-
reductions
cs.stackexchange
Partition into pairs with minimum absolute difference, NP-hard?
https://www.generacodice.com/cn/articolo/1809714/partition-into-pairs-with-minimum-absolute-difference-np-hard
complexity-theory
-
np-hard
-
algorithms
-
reductions
cs.stackexchange
Can current quantum computers decide languages that Turing Machines cannot?
https://www.generacodice.com/cn/articolo/1809438/can-current-quantum-computers-decide-languages-that-turing-machines-cannot
turing-machines
-
quantum-computing
-
undecidability
-
reductions
-
church-turing-thesis
cs.stackexchange
«
7
8
9
10
11
12
»
发现结果: 998