The complexity of subcube partition relates to the additive structure of the support

The subcube partition of a Boolean function is a partition of {0,1}n into the union of subcubes ∪iCi, such that the value of the function f is the same on each vector of Ci, i.e. for every i and x,y∈Ci, f(x)=f(y). The complexity of it denotes by HSCP(f) is the minimum number of subcubes in a subcube...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 299; p. 105170
Main Author:	Hegyvári, Norbert
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.08.2024
Subjects:	Additive combinatorics Bernstein theorem Boolean cube Fourier analysis Harper Fourier analysis Boolean cube Additive combinatorics Bernstein theorem Harper
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!