Mitsunori OGIWARA
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.
Terms of Service
Forgot Password?
Create Account now.
Create Account
Special Section
Information for Authors
Top 10 Downloads