7 citations · 17 across the 16 of their papers we have counts for
8 papers · 1 filter
Resolution structure in HornSAT and CNFSAT
Koji Kobayashi
This article describes about the difference of resolution structure and size between HornSAT and CNFSAT. We can compute HornSAT by using clauses causality. Therefore we can compute…
Solvability of HornSAT and CNFSAT
Koji Kobayashi
This article describes the solvability of HornSAT and CNFSAT. Unsatisfiable HornCNF have partially ordered set that is made by causation of each clauses. In this partially ordered…
Finite and infinite basis in P and NP
Koji Kobayashi
This article provide new approach to solve P vs NP problem by using cardinality of bases function. About NP-Complete problems, we can divide to infinite disjunction of P-Complete p…
Circuit complexity and Problem structure in Hamming space
Koji Kobayashi
This paper describes about relation between circuit complexity and accept inputs structure in Hamming space by using almost all monotone circuit that emulate deterministic Turing m…
Topological approach to solve P versus NP
Koji Kobayashi
This paper talks about difference between P and NP by using topological space that mean resolution principle. I pay attention to restrictions of antecedent and consequent in resolu…
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…