Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Kuroda, Satoru"'
Autor:
Kuroda, Satoru
We formalize algorithms computing Pfaffian in the theory of bounded arithmetic for sharpL which is based on Berkowitz algorithm for the determinant. We also prove relations among Pfaffian properties. Furthermore, we give an algorithm for Pfaffian pai
Externí odkaz:
http://arxiv.org/abs/2404.01728
Autor:
Ken, Eitetsu, Kuroda, Satoru
In arXiv:1811.04313, a definition of determinant is formalized in the bounded arithmetic $VNC^{2}$. Following the presentation of [Gathen, 1993], we can formalize a definition of matrix rank in the same bounded arithmetic. In this article, we define
Externí odkaz:
http://arxiv.org/abs/2310.05982
Autor:
Kuroda, Satoru
In late 90's G.Takeuti and Y.Yasumoto gave forcing constructions for bounded arithmetic. We will reformulate their constructions using two-sort bounded arithmetic and prove the followings. 1. Generic extensions are related with P=NP problem. 2. J.Kra
Externí odkaz:
http://arxiv.org/abs/1804.03798
Autor:
Kuroda, Satoru
In this paper, we formalize Sprague-Grundy theory for combinatorial games in bounded arithmetic. We show that in the presence of Sprague-Grundy numbers, a fairly weak axioms capture PSPACE.
Externí odkaz:
http://arxiv.org/abs/1609.02408
Autor:
Kuroda, Satoru
We define a hierarchy of circuit complexity classes LD^i, whose depth are the inverse of a function in Ackermann hierarchy. Then we introduce extremely weak versions of length induction and construct a bounded arithmetic theory L^i_2 whose provably t
Externí odkaz:
http://arxiv.org/abs/cs/9907022
Autor:
Kuroda, Satoru1 (AUTHOR) satoru@mail.gpwu.ac.jp
Publikováno v:
Archive for Mathematical Logic. Feb2022, Vol. 61 Issue 1/2, p233-262. 30p.
Autor:
Kuroda, Satoru
Publikováno v:
数理解析研究所講究録. 2228:78-87
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::6b79771dc53da8f95b5fc1334052087e
http://hdl.handle.net/2433/279728
http://hdl.handle.net/2433/279728
Autor:
Doig, Peter, Boriack-Sjodin, P. Ann, Dumas, Jacques, Hu, Jun, Itoh, Kenji, Johnson, Kenneth, Kazmirski, Steven, Kinoshita, Tomohiko, Kuroda, Satoru, Sato, Tomo-o, Sugimoto, Kaori, Tohyama, Katsumi, Aoi, Hiroshi, Wakamatsu, Kazusa, Wang, Hongming
Publikováno v:
In Bioorganic & Medicinal Chemistry 1 November 2014 22(21):6256-6269
Autor:
Kuroda, Satoru
Publikováno v:
数理解析研究所講究録. 2150:41-55
In this paper, we apply forcing method for Bounded Arithmetic which was developed by G. Takeuti and M. Yasumoto to three sort theories. As a result, we obtain generic extensions which are models of a minimal theory for PSPACE. Proofs are sketchy and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::aeb4df060dd3ad1dd510f280b454ee8f
http://hdl.handle.net/2433/255055
http://hdl.handle.net/2433/255055
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.