Computer Science – Computational Complexity
Scientific paper
2007-07-10
Computer Science
Computational Complexity
17 pages
Scientific paper
This article is a short introduction to generic case complexity, which is a
recently developed way of measuring the difficulty of a computational problem
while ignoring atypical behavior on a small set of inputs. Generic case
complexity applies to both recursively solvable and recursively unsolvable
problems.
Gilman Robert
Miasnikov Alexei G.
Myasnikov Alexey D.
Ushakov Alexander
No associations
LandOfFree
Report on Generic Case Complexity 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 Report on Generic Case Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Report on Generic Case Complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-453344