Mitsunori Ogiwara

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Reductions to sets of low information content (extended abstract) Automata, Languages and Programming	2019-12-04	Paper
scientific article; zbMATH DE number 1414281 (Why is no real title available?)	2000-03-16	Paper
scientific article; zbMATH DE number 1398071 (Why is no real title available?)	2000-02-03	Paper
Generalized theorems on relationships among reducibility notions to certain complexity classes Mathematical Systems Theory	1994-07-26	Paper
scientific article; zbMATH DE number 512798 (Why is no real title available?)	1994-03-10	Paper
scientific article; zbMATH DE number 512846 (Why is no real title available?)	1994-03-10	Paper
A relationship between difference hierarchies and relativized polynomial hierarchies Mathematical Systems Theory	1993-08-22	Paper
A complexity theory for feasible closure properties Journal of Computer and System Sciences	1993-08-18	Paper
On sparse hard sets for counting classes Theoretical Computer Science	1993-05-24	Paper
Relating Equivalence and Reducibility to Sparse Sets SIAM Journal on Computing	1993-01-16	Paper
scientific article; zbMATH DE number 58301 (Why is no real title available?)	1992-09-27	Paper
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy SIAM Journal on Computing	1992-06-28	Paper
Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets SIAM Journal on Computing	1992-06-25	Paper

Research outcomes over time

This page was built for person: Mitsunori Ogiwara