한국어
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 - 이것은 페이지 9 페이지입니다 - GeneraCodice
Is the Clique Problem polynomial time reducible to the graph-Homomorphism Problem and if so what does the reduction look like?
https://www.generacodice.com/ko/articolo/2447894/is-the-clique-problem-polynomial-time-reducible-to-the-graph-homomorphism-problem-and-if-so-what-does-the-reduction-look-like
complexity-theory
-
np-complete
-
graphs
-
reductions
cs.stackexchange
특정 문제점 인스턴스로 다항행 다수 대용원 감소를 수행 할 수 있습니까?
https://www.generacodice.com/ko/articolo/2444506/특정-문제점-인스턴스로-다항행-다수-대용원-감소를-수행-할-수-있습니까
complexity-theory
-
reductions
cs.stackexchange
정수 선형 프로그램을위한 NP 완성도
https://www.generacodice.com/ko/articolo/2444160/정수-선형-프로그램을위한-np-완성도
np-complete
-
reductions
-
decision-problem
cs.stackexchange
Droid Trader 문제는 NP 완료입니다
https://www.generacodice.com/ko/articolo/2443926/droid-trader-문제는-np-완료입니다
complexity-theory
-
np-complete
-
reductions
cs.stackexchange
해밀턴 사이클, 확인 및 찾기
https://www.generacodice.com/ko/articolo/2442702/해밀턴-사이클-확인-및-찾기
complexity-theory
-
reductions
-
hamiltonian-path
cs.stackexchange
버텍스 커버에서 지배적 인 집합으로의 감소
https://www.generacodice.com/ko/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/ko/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/ko/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/ko/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/ko/articolo/1810070/reductions-from-non-decision-problems
complexity-theory
-
np-complete
-
computability
-
approximation
-
reductions
cs.stackexchange
«
6
7
8
9
10
11
»
결과가 발견되었습니다: 998