Computer Science – Computational Complexity
Scientific paper
2001-02-23
Computer Science
Computational Complexity
11 pages
Scientific paper
No P-immune set having exponential gaps is positive-Turing self-reducible.
Hemaspaandra Lane A.
Hempel Harald
No associations
LandOfFree
P-Immune Sets with Holes Lack Self-Reducibility Properties 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 P-Immune Sets with Holes Lack Self-Reducibility Properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and P-Immune Sets with Holes Lack Self-Reducibility Properties will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-465703