{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T09:33:41Z","timestamp":1649151221773},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,6]]},"abstract":"<jats:p> Traces can be viewed as parallel processes and the \"mean speedup\" of a trace monoid has been introduced as a measure of \"intrinsic parallelism\" of the monoid. We study the problem of computing the mean speedup under two conditions: uniform distribution on the words of given length and uniform distribution on the traces of given height. In the first case, we give an approximability result showing a probabilistic fully polynomial time approximation scheme, while, in the second case, we prove that the problem is NP-hard to approximate within n<jats:sup>1-c<\/jats:sup> for every \u220a &gt; 0, unless NP = coR. A further consequence is the hardness of the problem of generating traces of a given height uniformly at random. <\/jats:p>","DOI":"10.1142\/s0129054108005796","type":"journal-article","created":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T10:27:20Z","timestamp":1212488840000},"page":"497-511","source":"Crossref","is-referenced-by-count":1,"title":["APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS"],"prefix":"10.1142","volume":"19","author":[{"given":"ALBERTO","family":"BERTONI","sequence":"first","affiliation":[{"name":"Dipartimento di Scienze dell'Informazione, Universit\u00e0 degli Studi di Milano, via Comelico 39, 20135 Milano, Italy"}]},{"given":"ROBERTO","family":"RADICIONI","sequence":"additional","affiliation":[{"name":"Dipartimento di Scienze dell'Informazione, Universit\u00e0 degli Studi di Milano, via Comelico 39, 20135 Milano, Italy"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/9.880644"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1080\/15326349708807441"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.2.305"},{"key":"rf4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0079468","volume-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements","author":"Cartier P.","year":"1969"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/9.478227"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00233-4"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90287-K"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04166-6_72"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108005796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:33:12Z","timestamp":1565137992000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108005796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":10,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,6]]}},"alternative-id":["10.1142\/S0129054108005796"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108005796","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6]]}}}