#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1981

2001

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Abstract The study of the complexity of sets encompasses two complementary aims: (1) establishing—usually via explicit construction of algorithms-that sets are feasible, and (2) studying the relative… (More)

- Mitsunori Ogiwara, L. Hemachandra
- [] Proceedings of the Sixth Annual Structure in…
- 1991

The authors propose and develop a complexity theory of feasible closure properties. For each of the classes Hash P, SpanP, OptP, and MidP, they establish complete characterizations-in terms of… (More)

In this paper we give several generalized theorems concerning reducibility notions to certain complexity classes. We study classes that are either (I) closed under NP many-one reductions and… (More)

- Lane A. Hemaspaandra, Albrecht Hoene, +4 authors Jie Wang
- 1993

A set is P-selective if there is a polynomial-time semi-decision algorithm for the set---an algorithm that given any two strings decides which is ``more likely'''' to be in the set. This paper… (More)

- Kaichi Inaba, Misaki Shibui, Toshitaka Naganawa, Mitsunori Ogiwara, Noriaki Yoshikai
- Proceedings Symposium on Applications and the…
- 2001

The described intelligent parking service is a part of an ITS (intelligent transportation system) in which parking facilities are conceived of in terms of various new functions which they can… (More)

- Hikoyata Abe, Fujio Toda, Mitsunori Ogiwara
- IEEE Electron Device Letters
- 1993

A metal-base transistor of the MOMOM type with large current gain is reported. It uses Bi(Ba,Rb)O/sub 3/ and oxide semiconductors. I-V curves for a Bi(Ba,Rb)O/sub 3/ base transistor in the… (More)

It is shown for any k≥1, that the closure of NP under NCk reducibility coincides with that of NP under ACk−1 reducibility, thereby giving an answer to a basic question that has been open for a long… (More)