Similar Items: A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods
- Natural Transformations as Rewrite Rules and Monad Composition
- Consistency of circuit lower bounds with bounded theories
- Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
- On the consistency of stronger lower bounds for NEXP
- On the Natural Gradient of the Evidence Lower Bound
- A lower bound on web services composition