Monotonicity Testing for Boolean Functions over Graph Products
| dc.contributor.author | Chen, Zhengkun | |
| dc.date.accessioned | 2020-09-09 18:42:39 (GMT) | |
| dc.date.available | 2020-09-09 18:42:39 (GMT) | |
| dc.date.issued | 2020-09-09 | |
| dc.date.submitted | 2020-08-26 | |
| dc.identifier.uri | http://hdl.handle.net/10012/16269 | |
| dc.description.abstract | We establish a directed analogue of Chung and Tetali's isoperimetric inequality for graph products. We use this inequality to obtain new bounds on the query complexity for testing monotonicity of Boolean-valued functions over products of general posets. | en |
| dc.language.iso | en | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | Monotonicity Testing | en |
| dc.subject | Property Testing | en |
| dc.subject | Isoperimetry | en |
| dc.title | Monotonicity Testing for Boolean Functions over Graph Products | en |
| dc.type | Master 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 | Master of Mathematics | 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 |
