Computer Science – Computational Complexity
Scientific paper
2005-12-13
Computer Science
Computational Complexity
Scientific paper
We establish a relationship between the online mistake-bound model of learning and resource-bounded dimension. This connection is combined with the Winnow algorithm to obtain new results about the density of hard sets under adaptive reductions. This improves previous work of Fu (1995) and Lutz and Zhao (2000), and solves one of Lutz and Mayordomo's "Twelve Problems in Resource-Bounded Measure" (1999).
No associations
LandOfFree
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets 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 Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-81331