한국어
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 - 이것은 페이지 54 페이지입니다 - GeneraCodice
proving $P \subseteq PCP(0,O(log(n))$
https://www.generacodice.com/ko/articolo/1122114/proving-p-subseteq-pcp-0-o-log-n
complexity-theory
-
approximation
cs.stackexchange
Finding a tree that approximates the distances and total weights
https://www.generacodice.com/ko/articolo/1122035/finding-a-tree-that-approximates-the-distances-and-total-weights
approximation
-
algorithms
cs.stackexchange
Average length of s-t (simple) paths in a directed graph
https://www.generacodice.com/ko/articolo/1120815/average-length-of-s-t-simple-paths-in-a-directed-graph
complexity-theory
-
enumeration
-
approximation
-
algorithms
-
graphs
cs.stackexchange
Prize collecting steiner tree
https://www.generacodice.com/ko/articolo/1120620/prize-collecting-steiner-tree
optimization
-
approximation
-
algorithm-analysis
-
trees
cs.stackexchange
$1+\epsilon$ approximation for inapproximable problems
https://www.generacodice.com/ko/articolo/1119278/1-epsilon-approximation-for-inapproximable-problems
complexity-theory
-
np-complete
-
approximation
-
p-vs-np
-
parameterized-complexity
cs.stackexchange
Hardness of approximating 0-1 integer programs
https://www.generacodice.com/ko/articolo/1118484/hardness-of-approximating-0-1-integer-programs
complexity-theory
-
np-complete
-
approximation
-
integer-programming
cs.stackexchange
What does big O mean as a term of an approximation ratio?
https://www.generacodice.com/ko/articolo/1111992/what-does-big-o-mean-as-a-term-of-an-approximation-ratio
approximation
-
algorithms
-
asymptotics
cs.stackexchange
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
«
51
52
53
54
55
56
»
결과가 발견되었습니다: 581