New Learning and Testing Problems for Read-Once Functions
Computational Complexity
2009-12-21 v1
Abstract
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.
Cite
@article{arxiv.0912.3627,
title = {New Learning and Testing Problems for Read-Once Functions},
author = {Andrey A. Voronenko},
journal= {arXiv preprint arXiv:0912.3627},
year = {2009}
}