---

[*]‘O ŽŸ[#] [0]–ß [4]—š—ð
[1]�Å�V [2]�Å�‰ �¥[3]ºÒÝÄ—“

---

[8]Œ³‚ÌÍß°¼Þ‚É–ß‚é 332‚ÌÚ½”Ô‚©‚ç•\Ž¦

ŠC‘ºŒb—�“Þ

354Œ�’†�A1Œ�ƒqƒbƒg!

332 ƒŠƒ“ƒN 03/31 15:05 ID:S8A

The P versus NP problem is to determine whether every language accepted
by some nondeterministic algorithm in polynomial time is also accepted by
some (deterministic) algorithm in polynomial time.

[8]Œ³‚ÌÍß°¼Þ‚É–ß‚é

---

–¼‘O:
EÒ°Ù:
ºÒÝÄ:

sage
ID‚ð•\Ž¦
‰æ‘œ‚ð“Š�e(‚½‚ʃsƒN)
Œ»�Ý’n‚ðŽN‚·

---