"P-NP 문제"의 두 판 사이의 차이
둘러보기로 가기
검색하러 가기
Pythagoras0 (토론 | 기여) |
Pythagoras0 (토론 | 기여) |
||
| 1번째 줄: | 1번째 줄: | ||
| − | |||
| − | |||
| − | |||
| − | |||
==개요== | ==개요== | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| 28번째 줄: | 13번째 줄: | ||
* http://www.google.com/search?hl=en&tbs=tl:1&q= | * http://www.google.com/search?hl=en&tbs=tl:1&q= | ||
* [[수학사 연표]] | * [[수학사 연표]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
==메모== | ==메모== | ||
| 41번째 줄: | 22번째 줄: | ||
==관련된 항목들== | ==관련된 항목들== | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| 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 | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| 82번째 줄: | 40번째 줄: | ||
* [http://people.cs.uchicago.edu/%7Efortnow/papers/history.pdf A Short History of Computational Complexity]<br> | * [http://people.cs.uchicago.edu/%7Efortnow/papers/history.pdf A Short History of Computational Complexity]<br> | ||
** Fortnow, Lance; Homer, Steven (2003), Bulletin of the EATCS 80: 95–133 | ** Fortnow, Lance; Homer, Steven (2003), Bulletin of the EATCS 80: 95–133 | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| 94번째 줄: | 47번째 줄: | ||
* Computers and Intractability: A Guide to the Theory of NP-Completeness<br> | * Computers and Intractability: A Guide to the Theory of NP-Completeness<br> | ||
** 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 | ||
2013년 4월 20일 (토) 11:53 판
개요
역사
메모
관련된 항목들
사전 형태의 자료
- 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
관련논문
- 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