{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:00:18Z","timestamp":1648681218913},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:p> We continue the investigation of polynomial-time reducibilities along the directions of [8]. We show that there is a set which is f(n)-conjunctive (similarly f(n)-disjunctive) deterministic polynomial time reducible to a tally set but is not g(n)-conjunctive (respectively g(n)-disjunctive) deterministic polynomial time reducible to any sparse set. We also show that there is a set which is f(n)-conjunctive deterministic polynomial time reducible to a tally set but is not g(n)-turing non-deterministic polynomial time reducible to any tally set. Several interesting corollaries about the closure of sparse and tally sets under such reducibilities follow from these results. <\/jats:p>","DOI":"10.1142\/s0129054194000189","type":"journal-article","created":{"date-parts":[[2004,11,19]],"date-time":"2004-11-19T02:21:13Z","timestamp":1100830873000},"page":"319-328","source":"Crossref","is-referenced-by-count":0,"title":["CONJUNCTIVE AND DISJUNCTIVE REDUCIBILITIES TO SPARSE AND TALLY SETS REVISITED"],"prefix":"10.1142","volume":"05","author":[{"given":"PAVOL","family":"\u010eURI\u0160","sequence":"first","affiliation":[{"name":"Department of Computer Science, Comenius University, Mlynsk\u00e1 dolina, 842 15 Bratislava, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JOS\u00c9 D.P.","family":"ROLIM","sequence":"additional","affiliation":[{"name":"Centre Universitaire d\u2019Informatique, Universit\u00e9 de Gen\u00e8ve, 24 rue General Dufour, CH-1211 Gen\u00e8ve 4, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054194000189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:44:11Z","timestamp":1565138651000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054194000189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":0,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1142\/S0129054194000189"],"URL":"https:\/\/doi.org\/10.1142\/s0129054194000189","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}