Mitsunori Ogiwara

24 papers A* 2A 2C 1Journal 9Unranked 9
YearRankTypeTitle / Venue / Authors
2023 J jnl
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions.
Theory Comput. Syst.
Mitsunori Ogiwara, Kei Uchizawa
1994 J jnl
Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes.
Math. Syst. Theory
Mitsunori Ogiwara
1994 A conf
NC^k(NP) = AC^(k-1)(NP).
STACS
Mitsunori Ogiwara
1993 J jnl
A Complexity Theory for Feasible Closure Properties.
J. Comput. Syst. Sci.
Mitsunori Ogiwara, Lane A. Hemachandra
1993 J jnl
A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies.
Math. Syst. Theory
Richard Beigel, Richard Chang, Mitsunori Ogiwara
1993 — ch.
Is #P Closed Under Subtraction?
Current Trends in Theoretical Computer Science
Lane A. Hemachandra, Mitsunori Ogiwara
1993 — conf
On Closure Properties of #P in the Context of PF°#P.
SCT
Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
1993 J jnl
On Sparse Hard Sets for Counting Classes.
Theor. Comput. Sci.
Mitsunori Ogiwara, Antoni Lozano
1993 A conf
On Using Oracles That Compute Values.
STACS
Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
1993 — conf
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability.
SCT
Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman
1993 C conf
Selectivity.
ICCI
Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang
1992 J jnl
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy.
SIAM J. Comput.
Seinosuke Toda, Mitsunori Ogiwara
1992 — conf
How Hard Are Sparse Sets?
SCT
Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
1992 J jnl
Is #P Closed under Substraction?
Bull. EATCS
Lane A. Hemachandra, Mitsunori Ogiwara
1992 — conf
Reductions to Sets of Low Information Content.
Complexity Theory: Current Research
Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1992 A* conf
Reductions to Sets of Low Information Content.
ICALP
Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1992 J jnl
Relating Equivalence and Reducibility to Sparse Sets.
SIAM J. Comput.
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
1991 — conf
A Complexity Theory for Feasible Closure Properties.
SCT
Mitsunori Ogiwara, Lane A. Hemachandra
1991 — conf
Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy.
SCT
Seinosuke Toda, Mitsunori Ogiwara
1991 — conf
On One Query Self-Reducible Sets.
SCT
Mitsunori Ogiwara, Antoni Lozano
1991 J jnl
On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets.
SIAM J. Comput.
Mitsunori Ogiwara, Osamu Watanabe
1991 — conf
Relating Equivalence and Reducibility to Sparse Sets.
SCT
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
1990 A* conf
On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
STOC
Mitsunori Ogiwara, Osamu Watanabe
1990 — conf
On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract).
SCT
Mitsunori Ogiwara, Osamu Watanabe