#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2015

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Sensitivity is an important complexity measure of Boolean functions. In this paper we present properties of the minimal and maximal sensitivity of the simplified weighted sum function. A simple close formula of the minimal sensitivity of the simplified weighted sum function is obtained. A phenomenon is exhibited that the minimal sensitivity of the weighted… (More)

- Xiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, Zeying Xu
- Conference on Computational Complexity
- 2015

We consider the problem of finding a fully colored base triangle on the 2-dimensional Möbius band under the standard boundary condition, proving it to be PPA-complete. The proof is based on a construction for the DPZP problem, that of finding a zero point under a discrete version of continuity condition. It further derives PPA-completeness for versions on… (More)

- Yaokun Wu, Zeying Xu, Yinfeng Zhu
- Electr. J. Comb.
- 2017

Generalizing the idea of viewing a digraph as a model of a linear map, we suggest a multi-variable analogue of a digraph, called a hydra, as a model of a multi-linear map. Walks in digraphs correspond to usual matrix multiplication while walks in hydras correspond to the tensor multiplication introduced by Robert Grone in 1987. By viewing matrix… (More)

- ‹
- 1
- ›