{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:19:29Z","timestamp":1742912369377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_16","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"199-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Skew Circuits of Small Width"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Balaji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Krebs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nutan","family":"Limaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"16_CR1","unstructured":"Barrington, D.A.: Width-3 permutation branching programs. Technical Memo MIT\/LCS\/TM-293, Massachusetts Institute of Technology, Laboratory for Computer Science (1985)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"DA Barrington","year":"1989","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs can recognize exactly those languages in \n$$NC^1$$\n. Journal of Computer and System Sciences 38, 150\u2013164 (1989)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1137\/0215040","volume":"15","author":"A Borodin","year":"1986","unstructured":"Borodin, A., Dolev, D., Fich, F.E., Paul, W.: Bounds for width two branching programs. SIAM Journal on Computing 15(2), 549\u2013560 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ipl.2005.01.012","volume":"94","author":"A Brodsky","year":"2005","unstructured":"Brodsky, A.: An impossibility gap between width-4 and width-5 permutation branching programs. Information Processing Letters 94(4), 159\u2013164 (2005)","journal-title":"Information Processing Letters"},{"key":"16_CR5","unstructured":"Herstein, I.N.: Topics in algebra. John Wiley & Sons (2006)"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C-Y Lee","year":"1959","unstructured":"Lee, C.-Y.: Representation of switching circuits by binary-decision programs. Bell System Technical Journal 38(4), 985\u2013999 (1959)","journal-title":"Bell System Technical Journal"},{"key":"16_CR7","unstructured":"Masek, W.J.: A fast algorithm for the string editing problem and decision graph complexity. PhD thesis, Massachusetts Institute of Technology (1976)"},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01137685","volume":"41","author":"AA Razborov","year":"1987","unstructured":"Razborov, A.A.: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Mathematical Notes 41(4), 333\u2013338 (1987)","journal-title":"Mathematical Notes"},{"key":"16_CR9","unstructured":"Rao, B.V.R.: A study of width bounded arithmetic circuits and the complexity of matroid isomorphism. [HBNI TH 17] (2010)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for boolean circuit complexity. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 77\u201382. ACM (1987)","DOI":"10.1145\/28395.28404"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00037-009-0267-3","volume":"18","author":"E Viola","year":"2009","unstructured":"Viola, E.: On approximate majority and probabilistic time. Computational Complexity 18(3), 337\u2013375 (2009)","journal-title":"Computational Complexity"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:26:10Z","timestamp":1676946370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}