Another look at degree lower bounds for polynomial calculus

Yuval Filmus

doi:10.1016/j.tcs.2019.09.023

Another look at degree lower bounds for polynomial calculus

Yuval Filmus

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

Polynomial complexity is an algebraic proof system inspired by Gröbner bases which was introduced by Clegg, Edmonds and Impagliazzo. Alekhnovich and Razborov devised a method for proving degree lower bounds for polynomial calculus. We present an alternative account of their method, which also encompasses a generalization due to Galesi and Lauria.

Original language	English
Pages (from-to)	286-293
Number of pages	8
Journal	Theoretical Computer Science
Volume	796
DOIs	https://doi.org/10.1016/j.tcs.2019.09.023
State	Published - 3 Dec 2019

Keywords

Degree
Lower bounds
Polynomial calculus
Proof complexity

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2019.09.023

Cite this

@article{44f3cfc1c4e3427e96a20f08b711c834,

title = "Another look at degree lower bounds for polynomial calculus",

abstract = "Polynomial complexity is an algebraic proof system inspired by Gr{\"o}bner bases which was introduced by Clegg, Edmonds and Impagliazzo. Alekhnovich and Razborov devised a method for proving degree lower bounds for polynomial calculus. We present an alternative account of their method, which also encompasses a generalization due to Galesi and Lauria.",

keywords = "Degree, Lower bounds, Polynomial calculus, Proof complexity",

author = "Yuval Filmus",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier B.V.",

year = "2019",

month = dec,

day = "3",

doi = "10.1016/j.tcs.2019.09.023",

language = "الإنجليزيّة",

volume = "796",

pages = "286--293",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Another look at degree lower bounds for polynomial calculus

AU - Filmus, Yuval

PY - 2019/12/3

Y1 - 2019/12/3

N2 - Polynomial complexity is an algebraic proof system inspired by Gröbner bases which was introduced by Clegg, Edmonds and Impagliazzo. Alekhnovich and Razborov devised a method for proving degree lower bounds for polynomial calculus. We present an alternative account of their method, which also encompasses a generalization due to Galesi and Lauria.

AB - Polynomial complexity is an algebraic proof system inspired by Gröbner bases which was introduced by Clegg, Edmonds and Impagliazzo. Alekhnovich and Razborov devised a method for proving degree lower bounds for polynomial calculus. We present an alternative account of their method, which also encompasses a generalization due to Galesi and Lauria.

KW - Degree

KW - Lower bounds

KW - Polynomial calculus

KW - Proof complexity

UR - http://www.scopus.com/inward/record.url?scp=85072545451&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2019.09.023

DO - 10.1016/j.tcs.2019.09.023

M3 - مقالة

SN - 0304-3975

VL - 796

SP - 286

EP - 293

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Another look at degree lower bounds for polynomial calculus

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this