On the average complexity of some P-complete problems

dc.contributor.author	Serna Iglesias, María José
dc.contributor.author	Xhafa Xhafa, Fatos
dc.contributor.other	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned	2016-02-03T11:48:22Z
dc.date.available	2016-02-03T11:48:22Z
dc.date.issued	1995-10
dc.identifier.citation	Serna, M., Xhafa, F. "On the average complexity of some P-complete problems". 1995.
dc.identifier.uri	http://hdl.handle.net/2117/82485
dc.description.abstract	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.
dc.format.extent	12 p.
dc.language.iso	eng
dc.subject	Àrees temàtiques de la UPC::Informàtica
dc.subject.other	Complexity
dc.subject.other	P-complet problems
dc.title	On the average complexity of some P-complete problems
dc.type	External research report
dc.rights.access	Open Access
local.identifier.drac	647359
dc.description.version	Postprint (published version)
local.citation.author	Serna, M.; Xhafa, F.

UPCommons. Portal del coneixement obert de la UPC