P=NP
| dc.creator | Bringsjord, Selmer | |
| dc.creator | Taylor, Joshua | |
| dc.date | 2004-06-28 | |
| dc.date.accessioned | 2026-07-07T03:21:30Z | |
| dc.date.available | 2026-07-07T03:21:30Z | |
| dc.description | We claim to resolve the P=?NP problem via a formal argument for P=NP. | |
| dc.identifier | https://arxiv.org/abs/cs/0406056 | |
| dc.identifier | http://arxiv.org/abs/cs/0406056 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32218 | |
| dc.subject | Computational Complexity | |
| dc.subject | Artificial Intelligence | |
| dc.title | P=NP | |
| dc.type | text |