We show that some P-complete problems can be solved efficiently in average NC. The probabilistic model we consider is the sample space of input instances with underlying distribution the uniform one. The parallel algorithms use a polynomial number of processors and have expected time polylogarithmic in instance size.
CitationSerna, M., Xhafa, F. "On the average complexity of some P-complete problems". 1995.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com