dc.contributor.author Levi, Amit dc.date.accessioned 2020-07-08 16:48:21 (GMT) dc.date.available 2020-07-08 16:48:21 (GMT) dc.date.issued 2020-07-08 dc.date.submitted 2020-07-06 dc.identifier.uri http://hdl.handle.net/10012/16050 dc.description.abstract Over the past few decades property testing has became an active field of study in theoretical computer science. The algorithmic task is to determine, given access to an unknown large object (e.g., function, graph, probability distribution), whether it has some fixed property, or it is far from any object having the property. The approximate nature of these algorithms allows in many cases to achieve a significant saving in running time, and obtain \emph{sublinear} running time. Nevertheless, in various settings and applications, accepting only inputs that exactly have a certain property is too restrictive, and it is more beneficial to distinguish between inputs that are close to having the property, and those that are far from it. The framework of \emph{tolerant} testing tackles this exact problem. In this thesis, we will focus on one of the most fundamental properties of Boolean functions: the property of being a \emph{$k$-junta} (i.e., being dependent on at most $k$ variables). en The first chapter focuses on algorithms for tolerant junta testing. In particular, we show that there exists a $\poly(k)$ query algorithm distinguishing functions close to $k$-juntas and functions that are far from $2k$-juntas. We also show how to obtain a trade-off between the tolerance" of the algorithm and its query complexity. The second chapter focuses on establishing a query lower bound for tolerant junta testing. In particular, we show that any non-adaptive tolerant junta tester, is required to make at least $\Omega(k^2/\polylog k)$ queries. The third chapter considers tolerant testing in a more general context, and asks whether tolerant testing is strictly harder than standard testing. In particular, we show that for any constant $\ell\in \N$, there exists a property $\calP_\ell$ such that $\calP_\ell$ can be tested in $O(1)$ queries, but any tolerant tester for $\calP_\ell$ is required to make at least $\Omega(n/\log^{(\ell)}n)$ queries (where $\log^{(\ell)}$ denote the $\ell$ times iterated log function). The final chapter focuses on applications. We show how to leverage the techniques developed in previous chapters to obtain results on tolerant isomorphism testing, unateness testing, and erasure resilient testing. dc.language.iso en en dc.publisher University of Waterloo en dc.subject juntas en dc.subject Property testing en dc.subject Tolerant testing en dc.subject Boolean functions en dc.title On Tolerant Testing and Tolerant Junta Testing en dc.type Doctoral Thesis en dc.pending false uws-etd.degree.department David R. Cheriton School of Computer Science en uws-etd.degree.discipline Computer Science en uws-etd.degree.grantor University of Waterloo en uws-etd.degree Doctor of Philosophy en uws.contributor.advisor Blais, Eric uws.contributor.affiliation1 Faculty of Mathematics en uws.published.city Waterloo en uws.published.country Canada en uws.published.province Ontario en uws.typeOfResource Text en uws.peerReviewStatus Unreviewed en uws.scholarLevel Graduate en
﻿

### This item appears in the following Collection(s)

UWSpace

University of Waterloo Library
200 University Avenue West