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...

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 60; číslo 2; s. 233 - 260
Hlavní autori:	Pallavoor, Ramesh Krishnan S., Raskhodnikova, Sofya, Waingarten, Erik
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York John Wiley & Sons, Inc 01.03.2022 Wiley Subscription Services, Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!