Sign inSubmit

Journal of Computer Science

ISSN 1549-3636 (print)eISSN 1552-6607 (online) Open access
Sign up for alertsSubmit manuscript
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
Research Article · Open access · Published 8 August 2024

p ≠ np: The Set of Deterministic Problems that are Solvable in Polynomial Time is Unequal to the Set of Non-Deterministic Problems that are Solvable in Polynomial Time

Andres Boldori
ArticleArticle metrics

Since publication

7,106Views
3,153PDF downloads
0Citations (Crossref)

Views and downloads by month

NovDecJanFebMarAprMayJunJulAugSepOct
Views PDF downloadsLast 12 months, counted as COUNTER asks (robots and repeat clicks within 30 seconds left out)
Show as a table
Views and downloads by month
MonthViewsDownloads
Nov 2025226150
Dec 2025209104
Jan 2026228120
Feb 202620690
Mar 2026319113
Apr 2026186125
May 2026428156
Jun 2026318135
Jul 2026207126
Aug 2026134107
Sep 2026143108
Oct 2026139118

Citing articles (0)

No article has cited this one yet. Citing articles are read from Crossref’s cited-by service every week and listed here with their journal and year, newest first.