The SCEAS System
| |||||||

## Search the dblp DataBase
Mitsunori Ogiwara:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
**Relating Equivalence and Reducibility to Sparse Sets.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:220-229 [Conf] - Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
**How Hard Are Sparse Sets?**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:222-238 [Conf] - Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman
**P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:52-64 [Conf] - Mitsunori Ogiwara, Lane A. Hemachandra
**A Complexity Theory for Feasible Closure Properties.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:16-29 [Conf] - Mitsunori Ogiwara, Antoni Lozano
**On One Query Self-Reducible Sets.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:139-151 [Conf] - Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
**On Closure Properties of #P in the Context of PF°#P.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:139-146 [Conf] - Mitsunori Ogiwara, Osamu Watanabe
**On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract).**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:2- [Conf] - Seinosuke Toda, Mitsunori Ogiwara
**Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:2-12 [Conf] - Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
**Reductions to Sets of Low Information Content.**[Citation Graph (0, 0)][DBLP] Complexity Theory: Current Research, 1992, pp:1-46 [Conf] - Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
**Reductions to Sets of Low Information Content.**[Citation Graph (0, 0)][DBLP] ICALP, 1992, pp:162-173 [Conf] - Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang
**Selectivity.**[Citation Graph (0, 0)][DBLP] ICCI, 1993, pp:55-59 [Conf] - Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
**On Using Oracles That Compute Values.**[Citation Graph (0, 0)][DBLP] STACS, 1993, pp:398-407 [Conf] - Mitsunori Ogiwara
**NC^k(NP) = AC^(k-1)(NP).**[Citation Graph (0, 0)][DBLP] STACS, 1994, pp:313-324 [Conf] - Mitsunori Ogiwara, Osamu Watanabe
**On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets**[Citation Graph (0, 0)][DBLP] STOC, 1990, pp:457-467 [Conf] - Lane A. Hemachandra, Mitsunori Ogiwara
**Is #P Closed under Substraction?**[Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1992, v:46, n:, pp:107-123 [Journal] - Mitsunori Ogiwara, Lane A. Hemachandra
**A Complexity Theory for Feasible Closure Properties.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1993, v:46, n:3, pp:295-325 [Journal] - Richard Beigel, Richard Chang, Mitsunori Ogiwara
**A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1993, v:26, n:3, pp:293-310 [Journal] - Mitsunori Ogiwara
**Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1994, v:27, n:3, pp:189-200 [Journal] - Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
**Relating Equivalence and Reducibility to Sparse Sets.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:3, pp:521-539 [Journal] - Mitsunori Ogiwara, Osamu Watanabe
**On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:3, pp:471-483 [Journal] - Seinosuke Toda, Mitsunori Ogiwara
**Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:2, pp:316-328 [Journal] - Mitsunori Ogiwara, Antoni Lozano
**On Sparse Hard Sets for Counting Classes.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:112, n:2, pp:255-275 [Journal]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |