7 citations · 17 across the 16 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.CC2011
Small Jump with Negation-UTM Trampoline
Koji Kobayashi
This paper divide some complexity class by using fixpoint and fixpointless area of Decidable Universal Turing Machine (UTM). Decidable Deterministic Turing Machine (DTM) have fixpo…
cs.CC2011★ 3 cited
NP is not AL and P is not NC is not NL is not L
Koji Kobayashi
This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and NL is not L. The point about this paper is the depend relation of the problem that need other problem'…
cs.LO2011
Connection and Dispersion of Computation
Koji Kobayashi
This paper talk about the influence of Connection and Dispersion on Computational Complexity. And talk about the HornCNF's connection and CNF's dispersion, and show the difference…