한국어
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
태그 approximation - 이것은 페이지 55 페이지입니다 - GeneraCodice
Find $\epsilon'$ s.t $L_\epsilon$ is $\mathsf{NP}$-hard for any $\epsilon<\epsilon'$
https://www.generacodice.com/ko/articolo/1111537/find-epsilon-s-t-l-epsilon-is-mathsf-np-hard-for-any-epsilon-epsilon
complexity-theory
-
satisfiability
-
approximation
cs.stackexchange
For what values of A and B is the gap-VC-[A,B] problem NP-HARD?
https://www.generacodice.com/ko/articolo/1111102/for-what-values-of-a-and-b-is-the-gap-vc-a-b-problem-np-hard
graph-theory
-
complexity-theory
-
approximation
cs.stackexchange
Inapproximability result implies apx-hardness?
https://www.generacodice.com/ko/articolo/1110443/inapproximability-result-implies-apx-hardness
complexity-theory
-
approximation
cs.stackexchange
Randomized Rounding of Solutions to Linear Programs
https://www.generacodice.com/ko/articolo/1110246/randomized-rounding-of-solutions-to-linear-programs
optimization
-
linear-programming
-
approximation
-
randomized-algorithms
cs.stackexchange
Approximating the Kolmogorov complexity
https://www.generacodice.com/ko/articolo/1099142/approximating-the-kolmogorov-complexity
computability
-
approximation
-
data-compression
-
kolmogorov-complexity
cs.stackexchange
$L$ APX-hard thus PTAS for $L$ implies $\mathsf{P} = \mathsf{NP}$
https://www.generacodice.com/ko/articolo/1098585/l-apx-hard-thus-ptas-for-l-implies-mathsf-p-mathsf-np
complexity-theory
-
np-complete
-
approximation
cs.stackexchange
3-dimensional matching approximation algorithm (implementation details)
https://www.generacodice.com/ko/articolo/1097317/3-dimensional-matching-approximation-algorithm-implementation-details
approximation
-
matching
-
algorithms
-
graphs
cs.stackexchange
Approximation algorithm for TSP variant, fixed start and end anywhere but starting point + multiple visits at each vertex ALLOWED
https://www.generacodice.com/ko/articolo/1095449/approximation-algorithm-for-tsp-variant-fixed-start-and-end-anywhere-but-starting-point-multiple-visits-at-each-vertex-allowed
graph-theory
-
complexity-theory
-
approximation
-
algorithms
-
graphs
cs.stackexchange
What is the name of this logistic variant of TSP?
https://www.generacodice.com/ko/articolo/1095230/what-is-the-name-of-this-logistic-variant-of-tsp
optimization
-
approximation
-
algorithms
-
reference-request
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
«
52
53
54
55
56
57
»
결과가 발견되었습니다: 581