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 条

[21] On non-polynomial lower error bounds for adaptive strong approximation of SDEs
Yaroslavtseva, Larisa
JOURNAL OF COMPLEXITY, 2017, 42 : 1 - 18
[22] Polynomial multiplication over binary finite fields: new upper bounds
Alessandro De Piccoli
Andrea Visconti
Ottavio Giulio Rizzo
Journal of Cryptographic Engineering, 2020, 10 : 197 - 210
[23] Polynomial multiplication over binary finite fields: new upper bounds
De Piccoli, Alessandro
Visconti, Andrea
Rizzo, Ottavio Giulio
JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2020, 10 (03) : 197 - 210
[24] Polynomial evaluation over finite fields: new algorithms and complexity bounds
Elia, Michele
Rosenthal, Joachim
Schipani, Davide
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2012, 23 (3-4) : 129 - 141
[25] Polynomial evaluation over finite fields: new algorithms and complexity bounds
Michele Elia
Joachim Rosenthal
Davide Schipani
Applicable Algebra in Engineering, Communication and Computing, 2012, 23 : 129 - 141
[26] New Lower Bounds for the Constants in the Real Polynomial Hardy-Littlewood Inequality
Cavalcante, W.
Nunez-Alarcon, Daniel
Pellegrino, D.
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2016, 37 (08) : 927 - 937
[27] New bounds for exponential sums with a non-degenerate phase polynomial
Castryck, Wouter
Kien Huu Nguyen
JOURNAL DE MATHEMATIQUES PURES ET APPLIQUEES, 2019, 130 : 93 - 111
[28] New lower bounds for the maximal number of inseparable leaves of nonsingular polynomial foliations of the plane
Braun, Francisco
Fernandes, Filipe
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2020, 491 (01)
[29] THROUGH THE MINCING MACHINE WITH A BOOLEAN LAYER CAKE - NONSTANDARD COMPUTATIONS OVER BOOLEAN CIRCUITS IN THE LOWER-BOUNDS-TO-CIRCUIT-SIZE COMPLEXITY PROVING
BELAGA, EG
ACTA INFORMATICA, 1989, 26 (04) : 381 - 407
[30] New Non-Uniform Lower Bounds for Uniform Classes
Fortnow, Lance
Santhanam, Rahul
31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50

← 1 2 3 4 →