P-NP 문제

역사

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

사전 형태의 자료

• 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

블로그

• http://mathtaegu.cafe24.com/zbxe/iyagi/30627

메타데이터

위키데이터

• ID : Q205084

Spacy 패턴 목록

• [{'LOWER': 'computational'}, {'LOWER': 'complexity'}, {'LEMMA': 'theory'}]
• [{'LOWER': 'complexity'}, {'LEMMA': 'theory'}]