Let NDTIME(f(n),g(n)) denote the class of problems solvable in O(g(n)) time by a multi-tape Turing machine using an f(n)-bit non-deterministic oracle, and let DTIME(g(n)) = NDTIME(0, g(n)). We show that if all-pairs shortest paths problem (APSP) for directed graphs with N vertices integer edge weights within super-exponential range { −2Nk+o(1),....,2Nk+o(1) }, k≥1 does not admit truly subcubic ...

My purpose in this article is not to offer any original insights into Hegel’s ethics, but merely to provide a brief overview that draws upon the most reliable secondary sources. In order to help organize the material, I compare Hegel’s views with the communitarian critique of liberalism. Following this, there is a brief account of the relation between Hegel’s ethical and religious thought. Hege...

This paper addresses some of the recent developments in efficiency measurement using stochastic frontier SF models in some selected areas. The following three issues are discussed in details. First, estimation of SF models with input-oriented technical efficiency. Second, estimation of latent class models to address technological heterogeneity as well as heterogeneity in economic behavior. Fina...