All reports by Author Christian Ikenmeyer:

__
TR21-100
| 11th July 2021
__

Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh#### Karchmer-Wigderson Games for Hazard-free Computation

__
TR20-031
| 10th March 2020
__

Markus BlĂ¤ser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh#### Algebraic Branching Programs, Border Complexity, and Tangent Spaces

Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh

We present a Karchmer-Wigderson game to study the complexity of hazard-free formulas. This new game is both a generalization of the monotone Karchmer-Wigderson game and an analog of the classical Boolean Karchmer-Wigderson game. Therefore, it acts as a bridge between the existing monotone and general games.

Using this game, we ... more >>>

Markus BlĂ¤ser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh

Nisan showed in 1991 that the width of a smallest noncommutative single-(source,sink) algebraic branching program (ABP) to compute a noncommutative polynomial is given by the ranks of specific matrices. This means that the set of noncommutative polynomials with ABP width complexity at most $k$ is Zariski-closed, an important property in ... more >>>