Before revision:  as they appear to be insignificant in practice  In this paper, we demonstrate that this assumption can in fact have far more profound implications on time complexity than is obvious at first glance, and that a poor consideration of trade-offs can result in polynomially slower algorithms whose roots can be deeply and fundamentally ingrained into a programming language itself  While the general observation may not be novel from a theoretical standpoint, it is rarely (if ever)
After revision:  as they appear to be insignificant in practice In this paper, we demonstrate that this assumption can in fact have far more profound implications on time complexity than is obvious at first glance, and that a poor consideration of trade-offs can result in polynomially slower algorithms whose roots can be deeply and fundamentally ingrained into a programming language itself . While the general observation may not be novel from a theoretical standpoint, it is rarely (if ever)