Monotonicity Testing for Boolean Functions over Graph Products
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.
Collections
Cite this version of the work
Zhengkun Chen
(2020).
Monotonicity Testing for Boolean Functions over Graph Products. UWSpace.
http://hdl.handle.net/10012/16269
Other formats