한국어
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
태그 np-hard - 이것은 페이지 63 페이지입니다 - GeneraCodice
The $\text{k-key}$ problem
https://www.generacodice.com/ko/articolo/1097503/the-text-k-key-problem
complexity-theory
-
np-complete
-
np-hard
-
reductions
cs.stackexchange
A continuous optimization problem that reduces to TSP
https://www.generacodice.com/ko/articolo/1093664/a-continuous-optimization-problem-that-reduces-to-tsp
optimization
-
complexity-theory
-
np-hard
-
computable-analysis
cs.stackexchange
Proving that directed graph diagnosis is NP-hard
https://www.generacodice.com/ko/articolo/1092793/proving-that-directed-graph-diagnosis-is-np-hard
graph-theory
-
complexity-theory
-
np-hard
cs.stackexchange
Decision problems vs “real” problems that aren't yes-or-no
https://www.generacodice.com/ko/articolo/1091949/decision-problems-vs-real-problems-that-aren-t-yes-or-no
complexity-theory
-
approximation
-
np-hard
-
time-complexity
cs.stackexchange
Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?
https://www.generacodice.com/ko/articolo/1091693/why-hasn-t-there-been-an-encryption-algorithm-that-is-based-on-the-known-np-hard-problems
encryption
-
complexity-theory
-
cryptography
-
np-hard
cs.stackexchange
Easy reduction from 3SAT to Hamiltonian path problem
https://www.generacodice.com/ko/articolo/1091425/easy-reduction-from-3sat-to-hamiltonian-path-problem
complexity-theory
-
np-hard
cs.stackexchange
who knows algorithm about stones and backpack?
https://www.generacodice.com/ko/articolo/961397/who-knows-algorithm-about-stones-and-backpack
algorithm
-
bin-packing
-
prolog
-
np-hard
StackOverflow
Interesting variation to the subset sum problem
https://www.generacodice.com/ko/articolo/721726/interesting-variation-to-the-subset-sum-problem
algorithm
-
complexity-theory
-
dynamic-programming
-
np-hard
StackOverflow
다항식 시간을 사용한 "가장 어려운"문제는 무엇입니까?
https://www.generacodice.com/ko/articolo/410248/다항식-시간을-사용한-가장-어려운-문제는-무엇입니까
algorithm
-
np-hard
-
time-complexity
StackOverflow
최소 비용으로 강력하게 연결된 Digaph
https://www.generacodice.com/ko/articolo/406206/최소-비용으로-강력하게-연결된-digaph
algorithm
-
graph
-
np-hard
-
traveling-salesman
StackOverflow
«
60
61
62
63
64
65
»
결과가 발견되었습니다: 647