Date of Original Version

7-2010

Type

Working Paper

Rights Management

All Rights Reserved

Abstract or Description

Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardness results for the problem of finding a low degree polynomial threshold function (PTF) which has the maximum possible agreement with a given set of labeled examples in Rn x {-1; 1}.

Share

COinS