The Sensitivity Conjecture and the Log-rank Conjecture are among the most important and
challenging problems in concrete complexity. Incidentally, the Sensitivity Conjecture is …

The sensitivity conjecture which claims that the sensitivity complexity is polynomially related
to block sensitivity complexity, is one of the most important and challenging problem in …

Abstract The well-known Sensitivity Conjecture regarding combinatorial complexity
measures on Boolean functions states that for any Boolean function f:{0, 1\}^ n → {0, 1\} …

Abstract The well-known Sensitivity Conjecture regarding combinatorial complexity
measures on Boolean functions states that for any Boolean function f:{0, 1} n→{0, 1}, block …

In this article, we investigate the sensitivity complexity of hypergraph properties. We present
ak-uniform hypergraph property with sensitivity complexity O (n (⌈ k/3⌉) for any k≥ 3, where …

We study the maximum degree of large induced subgraphs of some highly symmetric
graphs. This type of problem for Boolean hypercubes was formulated as an equivalent …

The central focus of computational complexity theory is to measure the" hardness" of
computing different functions. Towards this end, several measures of complexity for Boolean …

The sensitivity conjecture proposed by Nisan and Szegedy in 1994, which asserts that for
any Boolean function, its sensitivity complexity is polynomially related to the block sensitivity …

The sensitivity conjecture is one of the central open problems in Boolean complexity. A
recent work of Gopalan et al.[CCC 2016] conjectured a robust analog of the sensitivity …

The topic of discrete Fourier analysis has been extensively studied in recent decades. It
plays an important role in theoretical computer science and discrete mathematics. One hand …