"P-NP 문제"의 두 판 사이의 차이
둘러보기로 가기
검색하러 가기
Pythagoras0 (토론 | 기여) |
Pythagoras0 (토론 | 기여) |
||
| (같은 사용자의 중간 판 3개는 보이지 않습니다) | |||
| 1번째 줄: | 1번째 줄: | ||
| − | |||
| − | |||
| − | |||
| − | |||
==개요== | ==개요== | ||
| − | + | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | + | ||
==역사== | ==역사== | ||
| − | + | ||
* http://www.google.com/search?hl=en&tbs=tl:1&q= | * http://www.google.com/search?hl=en&tbs=tl:1&q= | ||
* [[수학사 연표]] | * [[수학사 연표]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
==메모== | ==메모== | ||
| − | + | ||
| − | + | ||
==관련된 항목들== | ==관련된 항목들== | ||
| − | + | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | + | ==사전 형태의 자료== | |
| − | |||
| − | ==사전 | ||
* http://ko.wikipedia.org/wiki/ | * http://ko.wikipedia.org/wiki/ | ||
| 65번째 줄: | 31번째 줄: | ||
* http://en.wikipedia.org/wiki/P_versus_NP_problem | * http://en.wikipedia.org/wiki/P_versus_NP_problem | ||
* http://en.wikipedia.org/wiki/List_of_NP-complete_problems | * http://en.wikipedia.org/wiki/List_of_NP-complete_problems | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | + | ||
| − | |||
| − | |||
==관련논문== | ==관련논문== | ||
| − | + | * Schuh, Bernd R. 2014. “SAT for Pedestrians.” arXiv:1408.3286 [cs, Math], August. http://arxiv.org/abs/1408.3286. | |
| − | * [http://dx.doi.org/10.1145%2F1562164.1562186 The Status of the P Versus NP Problem] | + | * [http://dx.doi.org/10.1145%2F1562164.1562186 The Status of the P Versus NP Problem] |
** Lance Fortnow (September 2009), Communications of the ACM 52 (9): pp. 78–86 | ** Lance Fortnow (September 2009), Communications of the ACM 52 (9): pp. 78–86 | ||
| − | * [http://people.cs.uchicago.edu/%7Efortnow/papers/history.pdf A Short History of Computational Complexity] | + | * [http://people.cs.uchicago.edu/%7Efortnow/papers/history.pdf A Short History of Computational Complexity] |
** Fortnow, Lance; Homer, Steven (2003), Bulletin of the EATCS 80: 95–133 | ** Fortnow, Lance; Homer, Steven (2003), Bulletin of the EATCS 80: 95–133 | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | + | ||
==관련도서== | ==관련도서== | ||
| − | * Computers and Intractability: A Guide to the Theory of NP-Completeness | + | * Computers and Intractability: A Guide to the Theory of NP-Completeness |
** M. R. Garey, D. S. Johnson, 1979 | ** M. R. Garey, D. S. Johnson, 1979 | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
==블로그== | ==블로그== | ||
* http://mathtaegu.cafe24.com/zbxe/iyagi/30627 | * http://mathtaegu.cafe24.com/zbxe/iyagi/30627 | ||
| + | |||
| + | ==메타데이터== | ||
| + | ===위키데이터=== | ||
| + | * ID : [https://www.wikidata.org/wiki/Q205084 Q205084] | ||
| + | ===Spacy 패턴 목록=== | ||
| + | * [{'LOWER': 'computational'}, {'LOWER': 'complexity'}, {'LEMMA': 'theory'}] | ||
| + | * [{'LOWER': 'complexity'}, {'LEMMA': 'theory'}] | ||
2021년 2월 17일 (수) 03:50 기준 최신판
개요
역사
메모
관련된 항목들
사전 형태의 자료
- http://ko.wikipedia.org/wiki/
- http://en.wikipedia.org/wiki/Computational_complexity_theory
- http://en.wikipedia.org/wiki/P_versus_NP_problem
- http://en.wikipedia.org/wiki/List_of_NP-complete_problems
관련논문
- Schuh, Bernd R. 2014. “SAT for Pedestrians.” arXiv:1408.3286 [cs, Math], August. http://arxiv.org/abs/1408.3286.
- The Status of the P Versus NP Problem
- Lance Fortnow (September 2009), Communications of the ACM 52 (9): pp. 78–86
- A Short History of Computational Complexity
- Fortnow, Lance; Homer, Steven (2003), Bulletin of the EATCS 80: 95–133
관련도서
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- M. R. Garey, D. S. Johnson, 1979
블로그
메타데이터
위키데이터
- ID : Q205084
Spacy 패턴 목록
- [{'LOWER': 'computational'}, {'LOWER': 'complexity'}, {'LEMMA': 'theory'}]
- [{'LOWER': 'complexity'}, {'LEMMA': 'theory'}]