New Learning and Testing Problems for Read-Once Functions

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-349377

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.