{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:00Z","timestamp":1750307040482,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2213998","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"193-212","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Short proofs for the determinant identities"],"prefix":"10.1145","author":[{"given":"Pavel","family":"Hrubes","sequence":"first","affiliation":[{"name":"University of Calgary, Alberta, Canada"}]},{"given":"Iddo","family":"Tzameret","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Paul Beame and Toniann Pitassi. Propositional proof complexity: past present and future. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS (65):66--89 1998.  Paul Beame and Toniann Pitassi. Propositional proof complexity: past present and future. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS (65):66--89 1998."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90018-8"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Maria Luisa\n       \n      Bonet Samuel R.\n       \n      Buss and \n      \n      \n      Toniann\n       \n      Pitassi\n    .\n      \n  \n   \n  Are there hard examples for Frege systems? In Feasible mathematics II volume \n  13\n   of \n  Progr\n  . Comput. Sci. Appl. Logic pages \n  30\n  --\n  56\n  . \n  Birkhauser 1995\n  .  Maria Luisa Bonet Samuel R. Buss and Toniann Pitassi. Are there hard examples for Frege systems? In Feasible mathematics II volume 13 of Progr. Comput. Sci. Appl. Logic pages 30--56. Birkhauser 1995.","DOI":"10.1007\/978-1-4612-2566-9_3"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.9"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208010"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Emil Jer\u00e1bek. Dual weak pigeonhole principle Boolean complexity and derandomization. Ann. Pure Appl. Logic 129(1--3):1--37 2004.  Emil Jer\u00e1bek. Dual weak pigeonhole principle Boolean complexity and derandomization. Ann. Pure Appl. Logic 129(1--3):1--37 2004.","DOI":"10.1016\/j.apal.2003.12.003"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Jan\n       \n      Kraj\u00edcek\n    .\n      \n  \n   \n  Bounded arithmetic propositional logic and complexity theory volume \n  60\n   of \n  Encyclopedia of Mathematics and its Applications\n  . \n  Cambridge 1995\n  .   Jan Kraj\u00edcek. Bounded arithmetic propositional logic and complexity theory volume 60 of Encyclopedia of Mathematics and its Applications. Cambridge 1995.","DOI":"10.1017\/CBO9780511529948"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-008-0254-0"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1203350879"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"volume-title":"University of Toronto","year":"2001","author":"Soltys Michael","key":"e_1_3_2_2_12_1"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538363_34"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Michael Soltys and Stephen Cook. The proof complexity of linear algebra. Ann. Pure Appl. Logic 130(1--3):277--323 2004.  Michael Soltys and Stephen Cook. The proof complexity of linear algebra. Ann. Pure Appl. Logic 130(1--3):277--323 2004.","DOI":"10.1016\/j.apal.2003.10.018"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-003-0205-z"},{"key":"e_1_3_2_2_16_1","first-page":"182","volume":"264","author":"Strassen Volker","year":"1973","journal-title":"J. Reine Angew. Math."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212043"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646670.698972"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2213998","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2213998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2213998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":19,"alternative-id":["10.1145\/2213977.2213998","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2213998","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}