Mitsunori Ogiwara

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 1

Top Topics

Dynamic Systems

Predictive State Representations

Top Venues

Theory Comput. Syst.

Publications

Mitsunori Ogiwara, Kei Uchizawa
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions. Theory Comput. Syst. 67 (3) (2023)
Mitsunori Ogiwara
Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes. Math. Syst. Theory 27 (3) (1994)
Mitsunori Ogiwara
NC^k(NP) = AC^(k-1)(NP). STACS (1994)
Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
On Using Oracles That Compute Values. STACS (1993)
Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang
Selectivity. ICCI (1993)
Mitsunori Ogiwara, Antoni Lozano
On Sparse Hard Sets for Counting Classes. Theor. Comput. Sci. 112 (2) (1993)
Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
On Closure Properties of #P in the Context of PF°#P. Computational Complexity Conference (1993)
Mitsunori Ogiwara, Lane A. Hemachandra
A Complexity Theory for Feasible Closure Properties. J. Comput. Syst. Sci. 46 (3) (1993)
Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. Computational Complexity Conference (1993)
Richard Beigel, Richard Chang, Mitsunori Ogiwara
A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies. Math. Syst. Theory 26 (3) (1993)
Seinosuke Toda, Mitsunori Ogiwara
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 21 (2) (1992)
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. Complexity Theory: Current Research (1992)
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. ICALP (1992)
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
Relating Equivalence and Reducibility to Sparse Sets. SIAM J. Comput. 21 (3) (1992)
Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
How Hard Are Sparse Sets? Computational Complexity Conference (1992)
Lane A. Hemachandra, Mitsunori Ogiwara
Is #P Closed under Substraction? Bull. EATCS 46 (1992)
Seinosuke Toda, Mitsunori Ogiwara
Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. Computational Complexity Conference (1991)
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
Relating Equivalence and Reducibility to Sparse Sets. Computational Complexity Conference (1991)
Mitsunori Ogiwara, Antoni Lozano
On One Query Self-Reducible Sets. Computational Complexity Conference (1991)
Mitsunori Ogiwara, Osamu Watanabe
On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets. SIAM J. Comput. 20 (3) (1991)
Mitsunori Ogiwara, Lane A. Hemachandra
A Complexity Theory for Feasible Closure Properties. Computational Complexity Conference (1991)
Mitsunori Ogiwara, Osamu Watanabe
On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract). Computational Complexity Conference (1990)
Mitsunori Ogiwara, Osamu Watanabe
On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets STOC (1990)