Computer Science – Computational Complexity
Scientific paper
2009-12-18
Computer Science
Computational Complexity
Scientific paper
In the paper, we consider several types of queries for classical and new
problems of learning and testing read-once functions. In several cases, the
border between polynomial and exponential complexities is obtained.
No associations
LandOfFree
New Learning and Testing Problems for Read-Once Functions 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 New Learning and Testing Problems for Read-Once Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Learning and Testing Problems for Read-Once Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-349377