I've got this problem:
Write down a definition of P-completeness analogous to the definition of NP-completeness, i.e., using polynomial-time reductions.
Which problems are P-complete in this sense, and why?
- Thus, what is the problem, i.e., what must be changed if the goal is to come up with a more interesting notion of P-completeness?
I have an idea about the first part, but I don't have any idea about the second and third part. The first part is like the NP-Complete, and small change for P-Complete, which is wrong I know, but I want it that way!