We study the computational power of PC=P. We give a characterization of the class via single Turing machines. Based on the characterization, we give combinatorial problems that are
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Mitsunori OGIWARA, "A Characterization of PC=P" in IEICE TRANSACTIONS on Information,
vol. E75-D, no. 1, pp. 44-49, January 1992, doi: .
Abstract: We study the computational power of PC=P. We give a characterization of the class via single Turing machines. Based on the characterization, we give combinatorial problems that are
URL: https://global.ieice.org/en_transactions/information/10.1587/e75-d_1_44/_p
Copy
@ARTICLE{e75-d_1_44,
author={Mitsunori OGIWARA, },
journal={IEICE TRANSACTIONS on Information},
title={A Characterization of PC=P},
year={1992},
volume={E75-D},
number={1},
pages={44-49},
abstract={We study the computational power of PC=P. We give a characterization of the class via single Turing machines. Based on the characterization, we give combinatorial problems that are
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - A Characterization of PC=P
T2 - IEICE TRANSACTIONS on Information
SP - 44
EP - 49
AU - Mitsunori OGIWARA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 1992
AB - We study the computational power of PC=P. We give a characterization of the class via single Turing machines. Based on the characterization, we give combinatorial problems that are
ER -