Testing k-Monotonicity The Rise and Fall of Boolean Functions

Canonne, CL; Grigorescu, E; Guo, SY; Kumar, A; Wimmer, K

Canonne, CL (reprint author), Columbia Univ, New York, NY 10027 USA.

THEORY OF COMPUTING, 2019; 15 ():

Abstract

A Boolean k-monotone function defined over a finite poset domain D alternates between the values 0 and 1 at most k times on any ascending chain in D. ......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索