New Lower Bounds for Polynomial Calculus over Non-Boolean Bases

被引：0
|
作者：
The Institute of Mathematical Sciences , Chennai, India [1 ]
不详 [2 ]
机构：
来源：
Leibniz Int. Proc. Informatics, LIPIcs |
基金：
新加坡国家研究基金会;
关键词：
Boolean algebra - Differentiation (calculus) - Digital arithmetic - Theorem proving;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 39 条
  • [1] Lower bounds for the polynomial calculus
    A.A. Razborov
    computational complexity, 1998, 7 : 291 - 324
  • [2] Lower bounds for the polynomial calculus
    Razborov, AA
    COMPUTATIONAL COMPLEXITY, 1998, 7 (04) : 291 - 324
  • [3] Lower bounds for Polynomial Calculus: Non-binomial case
    Alekhnovich, M
    Razborov, AA
    42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 190 - 199
  • [4] Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases
    Chen, Ruiwen
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 223 - 234
  • [5] Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
    Filmus, Yuval
    Lauria, Massimo
    Miksa, Mladen
    Nordstrom, Jakob
    Vinyals, Marc
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 437 - 448
  • [6] Several remarks on non-Boolean functions over Boolean algebras
    Simovici, DA
    33RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2003, : 163 - 168
  • [7] Lower bounds for polynomial calculus: Nonbinomial ideals
    Alekhnovich, MV
    Razborov, AA
    DOKLADY MATHEMATICS, 2001, 64 (02) : 177 - 179
  • [8] Lower bounds for the polynomial calculus and the Grobner basis algorithm
    Impagliazzo, R
    Pudlák, P
    Sgall, J
    COMPUTATIONAL COMPLEXITY, 1999, 8 (02) : 127 - 144
  • [9] Another look at degree lower bounds for polynomial calculus
    Filmus, Yuval
    THEORETICAL COMPUTER SCIENCE, 2019, 796 : 286 - 293
  • [10] A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds
    Miksa, Mladen
    Nordstrom, Jakob
    JOURNAL OF THE ACM, 2024, 71 (06)
1234