On NP complete problems I
Minoru Fujimoto, Kunihiko Uehara

TL;DR
This paper investigates the NP-complete quadratic residue problem, arguing that due to the random distribution of solutions, it cannot be solved by nondeterministic polynomial processes, implying it does not belong to class P.
Contribution
It provides a novel analysis linking prime numbers and solution distribution to the complexity class of the quadratic residue problem.
Findings
Quadratic residue problem is NP-complete.
Solution distribution appears random.
Nondeterministic polynomial processes are insufficient.
Abstract
We study the quadratic residue problem known as an NP complete problem by way of the prime number and show that a nondeterministic polynomial process does not belong to the class P because of a random distribution of solutions for the quadratic residue problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematical Approximation and Integration · Cryptography and Residue Arithmetic
