Recent content by S.ALGH

  1. S

    What does it mean for a language not to be complete?

    it is computer science, and the question is : A language L is complete for a language class C with respect to polynomial time reduction if L belongs to C and L' <=p L for all L' belong to C. Show that ø and {0,1} are the only languages in P that are not complete for P with respect to polynomial...
  2. S

    What does it mean for a language not to be complete?

    Then why ø and {0,1} are not complete for P (polynomial) ??
  3. S

    What does it mean for a language not to be complete?

    Anyone can explain to me What does it mean for a language not to be complete? for example P has 2 languages are not complete for P ø and {0,1} are not complete for P.