SCEAS

The SCEAS System

Title:
Author:

Tsuyoshi Morioka: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Josh Buresh-Oppenheim, Tsuyoshi Morioka
Relativized NP Search Problems and Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
IEEE Conference on Computational Complexity, 2004, pp:54-67 [Conf]
Lei Zhang, Shunsuke Akifuji, Katsumi Kawai, Tsuyoshi Morioka
Comparison Between Test Driven Development and Waterfall Development in a Small-Scale Project. [Citation Graph (0, 0)][DBLP]
XP, 2006, pp:211-212 [Conf]
Stephen Cook, Tsuyoshi Morioka
Quantified propositional calculus and a second-order theory for NC¹. [Citation Graph (0, 0)][DBLP]
Arch. Math. Log., 2005, v:44, n:6, pp:711-749 [Journal]
Tsuyoshi Morioka
Classification of Search Problems and Their Definability in Bounded Arithmetic [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:082, pp:- [Journal]
Tsuyoshi Morioka
The Relative Complexity of Local Search Heuristics and the Iteration Principle [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:051, pp:- [Journal]
Josh Buresh-Oppenheim, Tsuyoshi Morioka
Relativized NP Search Problems and Propositional Proof Systems [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:084, pp:- [Journal]

Search in 0.001secs, Finished in 0.001secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP