Mitsunori Ogiwara

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+	Counting classes are at least as hard as the polynomial-time hierarchy	2002	Seinosuke Toda Mitsunori Ogiwara
+	Generalized theorems on relationships among reducibility notions to certain complexity classes	1994	Mitsunori Ogiwara
+	A complexity theory for feasible closure properties	1993	Mitsunori Ogiwara Lane A. Hemachandra
+	Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy	1992	Seinosuke Toda Mitsunori Ogiwara

Common Coauthors

Coauthor	Papers Together
Seinosuke Toda	2
Lane A. Hemachandra	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	A survey on counting classes	2002	T. Gundermannn N.A. Nasser Gerd Wechsung	3
+	The complexity of computing the permanent	1979	Leslie G. Valiant	3
+	Structural properties of the counting hierarchies	1988	Jacobo Torán Romero	2
+	Counting classes: Thresholds, parity, mods, and fewness	1990	Richard Beigel John Gill Ulrich Hertramp	2
+	The Power of Counting	1990	Uwe Schöning	1
+	Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy	1992	Seinosuke Toda Mitsunori Ogiwara	1
+	The Complexity of Enumeration and Reliability Problems	1979	Leslie G. Valiant	1
+	An oracle characterization of the counting hierarchy	1988	Jacobo Torán	1
+	Recognizing primes in random polynomial time	1987	Leonard M. Adleman Ming-Deh A. Huang	1
+	Counting classes are at least as hard as the polynomial-time hierarchy	2002	Seinosuke Toda Mitsunori Ogiwara	1