Approximating the distance to monotonicity of Boolean functions

We design a nonadaptive algorithm that, given oracle access to a function f:{0,1} n→{0,1} which is α‐far from monotone, makes poly(n,1/α) queries and returns an estimate that, with high probability, is an Õ(n)‐approximation to the distance of f to monotonicity. The analysis of our algorithm relies o...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 60; no. 2; pp. 233 - 260
Main Authors:	Pallavoor, Ramesh Krishnan S., Raskhodnikova, Sofya, Waingarten, Erik
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.03.2022 Wiley Subscription Services, Inc
Subjects:	Algorithms analysis of Boolean functions Approximation Boolean algebra Boolean functions Lower bounds Mathematical analysis property testing Queries sublinear algorithms tolerant and erasure‐resilient testing
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!