( en | de | ru )

 

Disambiguation of "Ogiwara, Mitsunori"

Author of the publication

copydeleteadd this publication to your clipboard
On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets

, and . STOC, page 457-467. ACM, (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Ogiwara, Mitsunori
add a person with the name Ogiwara, Mitsunori
 

Other publications of authors with the same name

On Sparse Hard Sets for Counting Classes., and . Theor. Comput. Sci., 112 (2): 255-275 (1993)A Complexity Theory for Feasible Closure Properties., and . J. Comput. Syst. Sci., 46 (3): 295-325 (1993)Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions., and . Theory Comput. Syst., 67 (3): 569-591 (June 2023)P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability., , and . SCT, page 52-64. IEEE Computer Society, (1993)Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes.. Math. Syst. Theory, 27 (3): 189-200 (1994)A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies., , and . Math. Syst. Theory, 26 (3): 293-310 (1993)NC^k(NP) = AC^(k-1)(NP).. STACS, volume 775 of Lecture Notes in Computer Science, page 313-324. Springer, (1994)On Closure Properties of #P in the Context of PF°#P., , , and . SCT, page 139-146. IEEE Computer Society, (1993)On One Query Self-Reducible Sets., and . SCT, page 139-151. IEEE Computer Society, (1991)Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy., and . SCT, page 2-12. IEEE Computer Society, (1991)