{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T13:08:47Z","timestamp":1791205727257,"version":"4.1.0"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1998,1]]},"abstract":"<jats:p>\n                    We prove that if we hit a de Morgan formula of size L with a random restriction from R\n                    <jats:sub>p<\/jats:sub>\n                    , then the expected remaining size is at most $O(p^2(\\log \\frac {1}{p})^{3\/2}L+p\\sqrt L)$. As a corollary we obtain an $\\Omega(n^{3-o(1)})$-formula-size lower bound for an explicit function in P. This is the strongest known lower bound for any explicit function in NP.\n                  <\/jats:p>","DOI":"10.1137\/s0097539794261556","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"48-64","source":"Crossref","is-referenced-by-count":93,"title":["The Shrinkage Exponent of de Morgan Formulas is 2"],"prefix":"10.1137","volume":"27","author":[{"given":"Johan H\u00c5","family":"stad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,28]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001358"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00081-S"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/0403021"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240040202"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240040203"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122698"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1109\/12.376165"},{"key":"R9","first-page":"0","author":"Andreev A.","year":"1987","journal-title":"Vestnik Moskov. Univ. Ser. I Mat. Mekh."},{"key":"R10","unstructured":"K. L. Rychkov,\n                      A modification of Khrapchenko\u2019s method and its application to bounding the complexity of \u03a0\u2010networks for coding functions\n                      , in Methods of Discrete Analysis in the Theory of Graphs and Circuits, Institut Matematiki SOAN SSSR, Novosibirsk, 1985, pp. 91\u201398 (in Russian)."},{"key":"R11","first-page":"110","volume":"2","author":"Subbotovskaja B.","year":"1961","journal-title":"Soviet Math. Dokl."},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01405045"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01747074"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539794261556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:14:26Z","timestamp":1787336066000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539794261556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["10.1137\/S0097539794261556"],"URL":"https:\/\/doi.org\/10.1137\/s0097539794261556","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}