{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:35:29Z","timestamp":1725618929263},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1145\/301250.301399","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T16:40:52Z","timestamp":1069778452000},"page":"547-556","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Linear gaps between degrees for the polynomial calculus modulo distinct primes"],"prefix":"10.1145","author":[{"given":"Sam","family":"Buss","sequence":"first","affiliation":[{"name":"Department of Mathematics, Univ. of Calif., San Diego, La Jolla, CA"}]},{"given":"Dima","family":"Grigoriev","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Pennsylvania State University, University Park, PA"}]},{"given":"Russell","family":"Impagliazzo","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Univ. of Calif., San Diego, La Jolla, CA"}]},{"given":"Toniann","family":"Pitassi","sequence":"additional","affiliation":[{"name":"Computer Science, University of Arizona, Tucson, AZ"}]}],"member":"320","published-online":{"date-parts":[[1999,5]]},"reference":[{"key":"e_1_3_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365714"},{"first-page":"59","volume-title":"American Mathematical Society","year":"1998","key":"e_1_3_2_1_2_2","unstructured":"S. R. Buss , Lower bounds on Nullsteltensatz proofs via designs, in Proof Complexity and Feasible Arithmetics, P. Beame and S. Buss, eds ., American Mathematical Society , 1998 , pp. 59 - 71 . S. R. Buss, Lower bounds on Nullsteltensatz proofs via designs, in Proof Complexity and Feasible Arithmetics, P. Beame and S. Buss, eds., American Mathematical Society, 1998, pp. 59-71."},{"key":"e_1_3_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294258"},{"key":"e_1_3_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237860"},{"volume-title":"Nulistellensalz lower bounds for Tseitin tautologies. To appear, 39th Annual {EEE Syrup. on Foundations of Computer Science","year":"1998","author":"GRIOORIEV","key":"e_1_3_2_1_5_2","unstructured":"D. GRIOORIEV , Nulistellensalz lower bounds for Tseitin tautologies. To appear, 39th Annual {EEE Syrup. on Foundations of Computer Science , 1998 . D. GRIOORIEV, Nulistellensalz lower bounds for Tseitin tautologies. To appear, 39th Annual {EEE Syrup. on Foundations of Computer Science, 1998."},{"volume-title":"Lower bounds for a proof system with an exponential speed-up over constant depih Frege systems and over polynomial calculus. Typeset manuscript","year":"1997","author":"KR EK","key":"e_1_3_2_1_6_2","unstructured":"J. KR ^Jfa EK , Lower bounds for a proof system with an exponential speed-up over constant depih Frege systems and over polynomial calculus. Typeset manuscript , 1997 . J. KR^JfaEK, Lower bounds for a proof system with an exponential speed-up over constant depih Frege systems and over polynomial calculus. Typeset manuscript, 1997."},{"volume-title":"On the degree of ideal membership proofs from uniform families of polynomials over a finite field. Typeset manuscript","year":"1998","key":"e_1_3_2_1_7_2","unstructured":"~ , On the degree of ideal membership proofs from uniform families of polynomials over a finite field. Typeset manuscript , 1998 . ~, On the degree of ideal membership proofs from uniform families of polynomials over a finite field. Typeset manuscript, 1998."},{"volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science ~31","author":"PITASS","key":"e_1_3_2_1_8_2","unstructured":"T. PITASS ; , Algebraic propositional proof systems , in Descriptive Complexity and Finite Models, N. Immerman and P. Kolaitis, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science ~31 , American Mathematics Society , I996, pp. 215-244. T. PITASS;, Algebraic propositional proof systems, in Descriptive Complexity and Finite Models, N. Immerman and P. Kolaitis, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science ~31, American Mathematics Society, I996, pp. 215-244."},{"volume-title":"Lower bounds for lhe polynomial calculus. Typeset manuscript","year":"1996","author":"R~","key":"e_1_3_2_1_9_2","unstructured":"A. A. R~ ^zBoaov , Lower bounds for lhe polynomial calculus. Typeset manuscript , 1996 . A. A. R~^zBoaov, Lower bounds for lhe polynomial calculus. Typeset manuscript, 1996."},{"key":"e_1_3_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"}],"event":{"name":"STOC99: ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Atlanta Georgia USA","acronym":"STOC99"},"container-title":["Proceedings of the thirty-first annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/301250.301399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T14:59:09Z","timestamp":1673449149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/301250.301399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":10,"alternative-id":["10.1145\/301250.301399","10.1145\/301250"],"URL":"http:\/\/dx.doi.org\/10.1145\/301250.301399","relation":{},"subject":[],"published":{"date-parts":[[1999,5]]},"assertion":[{"value":"1999-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}