45 citations · 82 across the 7 of their papers we have counts for
7 papers
A New Formula for the Determinant and Bounds on Its Tensor and Waring Ranks
Robin Houston, Adam P. Goucher, Nathaniel Johnston
We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show…
Proof equivalence in MLL is PSPACE-complete
Willem Heijltjes, Robin Houston
MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word p…
Tackling the Minimal Superpermutation Problem
Robin Houston
A superpermutation on symbols is a string that contains each of the permutations of the symbols as a contiguous substring. The shortest superpermutation on symbols…
Linear Logic without Units
Robin Houston
We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since…
Zen Puzzle Garden is NP-complete
Robin Houston, Joseph White, Martyn Amos
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove that deciding the solvability of ZPG is NP-complete.
Finite Products are Biproducts in a Compact Closed Category
Robin Houston
If a compact closed category has finite products or finite coproducts then it in fact has finite biproducts, and so is semi-additive.