P-NP 문제

 

 

 

 

재미있는 사실

 

• Math Overflow http://mathoverflow.net/search?q=
• 네이버 지식인 http://kin.search.naver.com/search.naver?where=kin_qna&query=

 

 

역사

 

• http://www.google.com/search?hl=en&tbs=tl:1&q=
• 수학사연표
•  

 

 

 

 

 

 

수학용어번역

• 단어사전 http://www.google.com/dictionary?langpair=en%7Cko&q=
• 발음사전 http://www.forvo.com/search/
• 대한수학회 수학 학술 용어집
  
  • http://mathnet.kaist.ac.kr/mathnet/math_list.php?mode=list&ftype=eng_term&fstr=
• 남·북한수학용어비교
• 대한수학회 수학용어한글화 게시판

 

 

사전 형태의 자료

• 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
• http://en.wikipedia.org/wiki/
• http://www.proofwiki.org/wiki/
• http://www.wolframalpha.com/input/?i=
• NIST Digital Library of Mathematical Functions
• The On-Line Encyclopedia of Integer Sequences
  
  • http://www.research.att.com/~njas/sequences/?q=

 

 

관련논문

• 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
• http://www.jstor.org/action/doBasicSearch?Query=
• http://www.ams.org/mathscinet
• http://dx.doi.org/

 

 

관련도서

• Computers and Intractability: A Guide to the Theory of NP-Completeness
  
  • M. R. Garey, D. S. Johnson, 1979
• 도서내검색
  
  • http://books.google.com/books?q=
  • http://book.daum.net/search/contentSearch.do?query=
• 도서검색
  
  • http://books.google.com/books?q=
  • http://book.daum.net/search/mainSearch.do?query=
  • http://book.daum.net/search/mainSearch.do?query=

 

 

 

 

블로그

• http://mathtaegu.cafe24.com/zbxe/iyagi/30627
• 구글 블로그 검색
  
  • http://blogsearch.google.com/blogsearch?q=
• 네이버