{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T22:24:40Z","timestamp":1767219880854,"version":"3.30.2"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3699,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0304-3975(02)00446-2","type":"journal-article","created":{"date-parts":[[2003,1,21]],"date-time":"2003-01-21T19:54:09Z","timestamp":1043178849000},"page":"83-102","source":"Crossref","is-referenced-by-count":22,"title":["Algebraic proof systems over formulas"],"prefix":"10.1016","volume":"303","author":[{"given":"Dima","family":"Grigoriev","sequence":"first","affiliation":[]},{"given":"Edward A.","family":"Hirsch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00446-2_BIB1","doi-asserted-by":"crossref","unstructured":"M. Alekhnovich, A.A. Razborov, Lower bounds for polynomial calculus: non-binomial case, in: Proc. 42nd Ann. IEEE Symp. on Foundations of Computer Science, FOCS\u201901, Las Vegas, NV, 2001, pp. 190\u2013199.","DOI":"10.1109\/SFCS.2001.959893"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02579166","article-title":"Eigenvalues and expanders","volume":"6","author":"Alon","year":"1986","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/S0304-3975(02)00446-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/plms\/s3-73.1.1","article-title":"Lower bounds on Hilbert's Nullstellensatz and propositional proofs","volume":"73","author":"Beame","year":"1996","journal-title":"Proc. London Math. Soc."},{"issue":"3","key":"10.1016\/S0304-3975(02)00446-2_BIB4","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/BF01294258","article-title":"Proof complexity in algebraic systems and bounded depth Frege systems with modular counting","volume":"6","author":"Beame","year":"1996","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB5","doi-asserted-by":"crossref","first-page":"916","DOI":"10.2307\/2273826","article-title":"Polynomial size proofs of the propositional pigeonhole principle","volume":"52","author":"Buss","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jcss.2000.1726","article-title":"Linear gaps between degrees for the polynomial calculus modulo distinct primes","volume":"62","author":"Buss","year":"2001","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00446-2_BIB7","doi-asserted-by":"crossref","unstructured":"M. Clegg, J. Edmonds, R. Impagliazzo, Using the Groebner basis algorithm to find proofs of unsatisfiability, in: Proc. 28th Ann. ACM Symp. on Theory of Computing, STOC\u201996, Philadelphia, PA, 1996, pp. 174\u2013183.","DOI":"10.1145\/237814.237860"},{"issue":"1","key":"10.1016\/S0304-3975(02)00446-2_BIB8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","article-title":"The relative efficiency of propositional proof systems","volume":"44","author":"Cook","year":"1979","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00037-001-8192-0","article-title":"Complexity of Positivstellensatz proofs for the knapsack","volume":"10","author":"Grigoriev","year":"2001","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB10","unstructured":"D. Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik, Complexity of semi-algebraic proofs, Tech. Report 01-103, Electronic Colloquium on Computational Complexity, December 2001."},{"issue":"6","key":"10.1016\/S0304-3975(02)00446-2_BIB11","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s002009900021","article-title":"Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields","volume":"10","author":"Grigoriev","year":"2000","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"issue":"1\u20133","key":"10.1016\/S0304-3975(02)00446-2_BIB12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0168-0072(01)00055-0","article-title":"Complexity of Null- and Positivstellensatz proofs","volume":"113","author":"Grigoriev","year":"2001","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"10.1016\/S0304-3975(02)00446-2_BIB13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s000370050024","article-title":"Lower bounds for the polynomial calculus","volume":"8","author":"Impagliazzo","year":"1999","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB14","article-title":"Bounded arithmetic, propositional logic, and complexity theory","volume":"Vol. 60","author":"Kraj\u0131́\u010dek","year":"1995"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB15","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/rsa.3240070103","article-title":"Exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle","volume":"7","author":"Kraj\u0131́\u010dek","year":"1995","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB16","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/mana.3211810110","article-title":"The Positivstellensatz and small deduction rules for systems of inequalities","volume":"181","author":"Lombardi","year":"1996","journal-title":"Math. Nachr."},{"key":"10.1016\/S0304-3975(02)00446-2_BIB17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0012-365X(92)00057-X","article-title":"Stable sets and polynomials","volume":"124","author":"Lov\u00e1sz","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(02)00446-2_BIB18","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","article-title":"Cones of matrices and set-functions and 0\u20131 optimization","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0304-3975(02)00446-2_BIB19","series-title":"Descriptive Complexity and Finite Models","article-title":"Algebraic propositional proof systems","volume":"Vol. 31","author":"Pitassi","year":"1997"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01200117","article-title":"Exponential lower bounds for the pigeonhole principle","volume":"3","author":"Pitassi","year":"1993","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s000370050013","article-title":"Lower bounds for the polynomial calculus","volume":"7","author":"Razborov","year":"1998","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(02)00446-2_BIB22","doi-asserted-by":"crossref","unstructured":"A. Shpilka, Affine projections of symmetric polynomials, in: Proc. 16th Ann. IEEE Conf. on Computational Complexity, Chicago, IL, 2001, pp. 160\u2013171.","DOI":"10.1109\/CCC.2001.933883"},{"year":"1930","series-title":"Moderne Algebra","author":"van der Waerden","key":"10.1016\/S0304-3975(02)00446-2_BIB23"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004462?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004462?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:30:52Z","timestamp":1733941852000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0304397502004462"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00446-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}