{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T04:51:48Z","timestamp":1790743908902,"version":"4.1.0"},"reference-count":8,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,11]]},"abstract":"<jats:p>This paper describes a family of depth-universal circuits. For any n, c, d there is a universal circuit $U(n,c,d)$ that can simulate any circuit $\\alpha $ having n inputs, of size c and depth d, and U has depth $O(d)$ and size $O(c^3 d\/\\log c)$. The construction is used to give an alternative proof of a theorem of Ruzzo showing the invariance under different uniformity conditions of complexity classes defined by uniform circuit families.<\/jats:p>","DOI":"10.1137\/0214058","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"833-839","source":"Crossref","is-referenced-by-count":32,"title":["A Depth-Universal Circuit"],"prefix":"10.1137","volume":"14","author":[{"given":"Stephen A.","family":"Cook","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H. James","family":"Hoover","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RBO77","doi-asserted-by":"publisher","DOI":"10.1137\/0206054"},{"key":"RCO81","first-page":"99","volume":"27","author":"Cook Stephen A.","year":"1981","journal-title":"Enseign. Math. (2)"},{"key":"RGP83","doi-asserted-by":"publisher","DOI":"10.1145\/322374.322382"},{"key":"RGO78","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804336"},{"key":"RADH83","unstructured":"F. M. Auf Der Heide,  Efficient simulations among several models of parallel computers,  1983, Manuscript"},{"key":"RHO78","unstructured":"H. J. Hoover,  Some topics in circuit complexity, TR-139\/80, Dept. Computer Science, Univ. Toronto, Toronto, Ontario, Canada,  1979, M.Sc. thesis, Dec."},{"key":"RRU81","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90038-6"},{"key":"RVA76","doi-asserted-by":"crossref","unstructured":"Leslie G. Valiant,  Universal circuits (preliminary report),  Eighth Annual ACM Symposium on Theory of Computing (Hershey, Pa., 1976), Assoc. Comput. Mach., New York,  1976,  196\u2013203 55:96050365.94044","DOI":"10.1145\/800113.803649"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:53Z","timestamp":1787337593000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["10.1137\/0214058"],"URL":"https:\/\/doi.org\/10.1137\/0214058","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}