139 citations · 168 across the 18 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017★ 5 cited
On the complexity of hazard-free circuits
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen +3
The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows th…
cs.DS2017★ 3 cited
Strassen's 2x2 matrix multiplication algorithm: A conceptual perspective
Christian Ikenmeyer, Vladimir Lysikov
The main purpose of this paper is pedagogical. Despite its importance, all proofs of the correctness of Strassen's famous 1969 algorithm to multiply two 2x2 matrices with only seve…