Tsuyoshi Morioka

Classification of Search Problems and Their Definability in Bounded Arithmetic

Tsuyoshi Morioka, 2001, Electron. Colloquium Comput. Complex..

Language Model Domain Adaptation Via Recurrent Neural Networks with Domain-Shared and Domain-Specific Representations

Tetsuji Ogawa, Tetsunori Kobayashi, Tomoharu Iwata, 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

Systematic Validation of Specifications against Business Requirements by Means of Formal Methods

Ryota Mibe, Tsuyoshi Morioka, 2010 .

Quantified propositional calculus and a second-order theory for NC1

Stephen A. Cook, Tsuyoshi Morioka, S. Cook, 2005, Arch. Math. Log..

Relativized NP search problems and propositional proof systems

Joshua Buresh-Oppenheim, Tsuyoshi Morioka, Tsuyoshi Morioka, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

Multiscale recurrent neural network based language model

Tetsunori Kobayashi, Tomoharu Iwata, Takaaki Hori, 2015, INTERSPEECH.

Comparison Between Test Driven Development and Waterfall Development in a Small-Scale Project

Lei Zhang, Katsumi Kawai, Tsuyoshi Morioka, 2006, XP.

The Relative Complexity of Local Search Heuristics and the Iteration Principle

Tsuyoshi Morioka, 2003, Electron. Colloquium Comput. Complex..

Logical approaches to the complexity of search problems: : proof complexity, quantified propositional calculus, and bounded arithmetic

Tsuyoshi Morioka, Tsuyoshi Morioka, 2005 .

Relativized NP search problems and propositional proof systems

Joshua Buresh-Oppenheim, Tsuyoshi Morioka, 2004 .