{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:13:10Z","timestamp":1729663990381,"version":"3.28.0"},"reference-count":47,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/lics.2004.1319607","type":"proceedings-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T19:14:14Z","timestamp":1100286854000},"page":"134-138","source":"Crossref","is-referenced-by-count":0,"title":["Feasible proofs and computations: partnership and fusion"],"prefix":"10.1109","author":[{"given":"A.A.","family":"Razborov","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"35","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0049-237X(98)80023-2","article-title":"The lengths of proofs","author":"pudla?k","year":"1998","journal-title":"Handbook of Proof Theory"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1145\/972639.972640"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0075316"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798353230"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.2307\/2275583"},{"journal-title":"Bounded Arithmetic","year":"1986","author":"buss","key":"16"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61440-0_116"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1999.766258"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.2307\/2275569"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2566-9_12"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1070\/IM1995v059n01ABEH000009"},{"key":"12","article-title":"Prepositional proof complexity: Past, present and future","volume":"tr98 67","author":"beame","year":"1998","journal-title":"Technical Report"},{"key":"21","volume":"17","author":"goldreich","year":"1998","journal-title":"Modern Cryptography Probabilistic Proofs and Pseudorandomness Algorithms and Combinatorics"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-9078-6_70"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492459"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2002.1004336"},{"journal-title":"Pseudorandom generators hard for k-dnf resolution and polynomial calculus resolution","year":"2002","author":"razborov","key":"40"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63248-4_8"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1203350879"},{"key":"46","article-title":"On the complexity of derivations in prepositional calculus","author":"tseitin","year":"1968","journal-title":"Studies in Constructive Mathematics and Mathematical Logic part II"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"23","first-page":"39","article-title":"Proofs that yield nothing but their validity, and a methodology of cryptographic protocol design","author":"goldwasser","year":"1986","journal-title":"Proceedings of the 21th IEEE Symposium on Foundations of Computer Science"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-22156-3"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.2307\/2275250"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.2307\/2275541"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.4064\/fm170-1-8"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1080938841"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959895"},{"journal-title":"SIAM Journal on Computing","year":"0","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-9110-3_2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892064"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2674"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267823"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.2307\/2269958"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276784"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"4","first-page":"18","article-title":"Lower bounds for the polynomial calculus: Non-binomial case","volume":"242","author":"alekhnovich","year":"2003","journal-title":"Proceedings of the Steklov Institute of Mathematics"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"journal-title":"Complexity and Approximation Combinatorial Optimization Problems and Their Approximability Properties","year":"1999","author":"ausiello","key":"8"}],"event":{"name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","start":{"date-parts":[[2004,7,17]]},"location":"Turku, Finland","end":{"date-parts":[[2004,7,17]]}},"container-title":["Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9221\/29239\/01319607.pdf?arnumber=1319607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T07:53:03Z","timestamp":1497599583000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1319607\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/lics.2004.1319607","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}