Date of Original Version

6-2005

Type

Article

Abstract or Description

In this paper we consider bounded real-valued functions over the discrete cube, f: {−1, 1}n → [−1, 1]. Such functions arise naturally in theoretical computer science, combinatorics, and the theory of social choice. It is often interesting to understand when these functions essentially depend on few coordinates.

DOI

10.1007/s11856-007-0068-9

Share

COinS