On the complexity of small description and related topics

Abstract

The class P/poly is known to be the class of sets with small descriptions, more specifically, polynomial size circuits. In this paper, we discuss the problem of obtaining the polynomial size circuits for a given set in P/poly by using the set as an oracle. Recent results on upper and lower bounds of the relative complexity of this problem are presented. We also introduce two related research topics — query learning and identity mapping network — and explain how they are related to this problem.KeywordsPolynomial TimeInternal NodeTuring MachineInput PatternTarget ConceptThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.