The search functionality is under construction.
The search functionality is under construction.

A Characterization of PC=P

Mitsunori OGIWARA

  • Full Text Views

    0

  • Cite this

Summary :

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 Pm-complete for the class.

Publication
IEICE TRANSACTIONS on Information Vol.E75-D No.1 pp.44-49
Publication Date
1992/01/25
Publicized
Online ISSN
DOI
Type of Manuscript
Special Section PAPER (Special Section on Theoretical Foundations of Computing)
Category

Authors

Keyword