Monotonicity Testing for Boolean Functions over Graph Products
Loading...
Date
Authors
Chen, Zhengkun
Journal Title
Journal ISSN
Volume Title
Publisher
University of Waterloo
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.