{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:30:58Z","timestamp":1787340658136,"version":"build-2736575974"},"reference-count":3,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,5]]},"abstract":"<jats:p>We show that, given a collection F of functions from a finite set D to itself, one can, in polynomial time, find a composition f of functions in F for which the size of $f(D)$ is minimized. This is to be contrasted with the fact that it is PSPACE-complete to determine whether a specific function f is a composition of functions in F. The running time of our algorithm is $O(|D|^2 (|D| + |F|))$, and this bound can be improved if an appropriately abbreviated representation of F is used. The problem first arose in connection with the minimization of conjunctive queries for relational databases.<\/jats:p>","DOI":"10.1137\/0214037","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"500-503","source":"Crossref","is-referenced-by-count":1,"title":["Composing Functions to Minimize Image Size"],"prefix":"10.1137","volume":"14","author":[{"given":"M. R.","family":"Garey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D. S.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0212042"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Dexter Kozen,  Lower bounds for natural proof systems,  18th Annual Symposium on Foundations of Computer Science (Providence, R.I., 1977), IEEE Comput. Sci., Long Beach, Calif.,  1977,  254\u2013266 58:13931","DOI":"10.1109\/SFCS.1977.16"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:43:03Z","timestamp":1787337783000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["10.1137\/0214037"],"URL":"https:\/\/doi.org\/10.1137\/0214037","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}