[Termtools] Incompatible Lower and Upper Bounds in "Runtime Complexity - Full Rewriting"
Johannes Waldmann
johannes.waldmann at htwk-leipzig.de
Mon Aug 29 13:20:16 CEST 2016
Dear all, my recent tests show some incompatible answers
in "Runtime Complexity - Full Rewriting"
http://nfa.imn.htwk-leipzig.de/termcomp-devel/problems/18024
- J.
More information about the Termtools
mailing list