ku on .NET
Mostly fun. Sometimes code. Maybe even dot NET
If there exists an A in the intersection between NP and P Space Complete, then NP Complete equals P Space Complete
If ∃A ∈ NP ∩ PSPACE-Complete, then NPC = PSPACE-Complete.
Motivation:
We know that a language B is in P space complete if B is in P space and for all A in P space, A
≤
pB.
Newer Post
Older Post
Home