Bounded Arithmetic and its Relation to Computational Complexity
論文 (6件):
KURODA Satoru. Axiomatizing proof tree concepts in bounded arithmetic. Proceedings of Computer Science Logic 2012, Leibniz International Proceedings in Informatics. 2012. 459-473
KURODA Satoru. Complete Problems and Bounded Arithmetic for LOGCFL. Proceedings of "Logical Approaches to Barriers in Computing and Complexity", Ernst-Moritz-Arndt--Universitat Greifswald. 2010. 71-74