Computer Science – Computational Complexity
Scientific paper
2004-11-11
Computer Science
Computational Complexity
Scientific paper
This article introduces three invariance principles under which P is
different from NP. In the second part a theorem of convergence is proven. This
theorem states that for any language L there exists an infinite sequence of
languages from O(n) that converges to L.
No associations
LandOfFree
On Invariance and Convergence in Time Complexity theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Invariance and Convergence in Time Complexity theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Invariance and Convergence in Time Complexity theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-87298