Mitsunori Ogiwara

Statistics

Publications

Citations

608

H-Index

Active since

1990

Affiliations

University of Electro-Communications(Current)

Tokyo Institute of Technology

University of Rochester

University at Buffalo, State University of New York

New York University

Mitsunori Ogiwara is an author at University of Electro-Communications specializing in engineering, computational complexity, and discrete mathematics.

Top concepts

EngineeringComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationTheory Of ComputingComplexityProof ComplexityAutomated ReasoningFormal Methods

Publications per year

1990–2003

Publications

Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets

Mitsunori Ogiwara, Osamu Watanabe · SIAM Journal on Computing · 1991 · 149 citations

Circuit Complexity, Theory Of Computing, Decision Problems +15

Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy

Seinosuke Toda, Mitsunori Ogiwara · SIAM Journal on Computing · 1992 · 124 citations

Combinatorics On Word, Counting Classes, Engineering +11

A complexity theory for feasible closure properties

Mitsunori Ogiwara, Lane A. Hemachandra · Journal of Computer and System Sciences · 1993 · 80 citations

Computational Complexity Theory, Engineering, Abstract Complexity +5

A relationship between difference hierarchies and relativized polynomial hierarchies

Richard Beigel, Richard Chang, Mitsunori Ogiwara · Theory of Computing Systems · 1993 · 53 citations

Real Algebraic Geometry, Algebraic Combinatorics, Difference Hierarchies +1

How hard are sparse sets?

Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe · 2003 · 52 citations

Structural Properties, Sparse Representation, Engineering +9

1–5 of 13