"P-NP 문제"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
3번째 줄: 3번째 줄:
 
==개요==
 
==개요==
  
 
+
  
 
+
  
 
==역사==
 
==역사==
  
 
+
  
 
* http://www.google.com/search?hl=en&tbs=tl:1&q=
 
* http://www.google.com/search?hl=en&tbs=tl:1&q=
17번째 줄: 17번째 줄:
 
==메모==
 
==메모==
  
 
+
  
 
+
  
 
==관련된 항목들==
 
==관련된 항목들==
  
 
+
  
==사전 형태의 자료==
+
==사전 형태의 자료==
  
 
* http://ko.wikipedia.org/wiki/
 
* http://ko.wikipedia.org/wiki/
32번째 줄: 32번째 줄:
 
* 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]<br>
+
* [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]<br>
+
* [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<br>
+
*  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
  

2014년 8월 15일 (금) 05:24 판


개요

역사


메모

관련된 항목들

사전 형태의 자료


관련논문


관련도서

  • Computers and Intractability: A Guide to the Theory of NP-Completeness
    • M. R. Garey, D. S. Johnson, 1979


블로그