Mitsunori Ogiwara - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2023

Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR FunctionsMitsunori Ogiwara, Kei Uchizawa. mst, 67(3):569-591, June 2023. [doi]

1994

NC^k(NP) = AC^(k-1)(NP)Mitsunori Ogiwara. STACS 1994: 313-324

Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity ClassesMitsunori Ogiwara. mst, 27(3):189-200, 1994.

1993

A Relationship Between Difference Hierarchies and Relativized Polynomial HierarchiesRichard Beigel, Richard Chang, Mitsunori Ogiwara. mst, 26(3):293-310, 1993.

On Using Oracles That Compute ValuesStephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman. STACS 1993: 398-407

Is #P Closed Under Subtraction?Lane A. Hemachandra, Mitsunori Ogiwara. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials. Volume 40 of World Scientific Series in Computer Science, pages 523-536, World Scientific, 1993. [doi]

SelectivityLane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang. icci 1993: 55-59

P-Selective Sets, and Reducing Search to Decision vs. Self-ReducabilityAshish V. Naik, Mitsunori Ogiwara, Alan L. Selman. cocoon 1993: 52-64

A Complexity Theory for Feasible Closure PropertiesMitsunori Ogiwara, Lane A. Hemachandra. jcss, 46(3):295-325, 1993.

On Sparse Hard Sets for Counting ClassesMitsunori Ogiwara, Antoni Lozano. TCS, 112(2):255-275, 1993.

On Closure Properties of #P in the Context of PF°#PMitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe. cocoon 1993: 139-146

1992

Relating Equivalence and Reducibility to Sparse SetsEric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe. SICOMP, 21(3):521-539, 1992.

Reductions to Sets of Low Information ContentVikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf. Dagstuhl 1993: 1-46

Reductions to Sets of Low Information ContentVikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf. icalp 1992: 162-173

How Hard Are Sparse Sets?Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe. coco 1992: 222-238

Is #P Closed under Substraction?Lane A. Hemachandra, Mitsunori Ogiwara. eatcs, 46:107-123, 1992.

Counting Classes are at Least as Hard as the Polynomial-Time HierarchySeinosuke Toda, Mitsunori Ogiwara. SICOMP, 21(2):316-328, 1992.

1991

1990

On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse SetsMitsunori Ogiwara, Osamu Watanabe. stoc 1990: 457-467

On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract)Mitsunori Ogiwara, Osamu Watanabe. cocoon 1990: 2

Sign in or sign up to see more results.

runs on WebDSL