Polynomial expansion of the Boolean functions by the threefold triangle method

被引:0
|
作者
Avgul, L
机构
来源
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
引用
下载
收藏
页码:12 / 24
页数:13
相关论文
共 50 条
  • [21] Mahler's Expansion and Boolean Functions
    Michon, Jean-Francis
    Valarcher, Pierre
    Yunes, Jean-Baptiste
    JOURNAL OF INTEGER SEQUENCES, 2007, 10 (03)
  • [22] Lower Bounds for Testing Triangle-freeness in Boolean Functions
    Bhattacharyya, Arnab
    Xie, Ning
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 87 - 98
  • [23] Lower bounds for testing triangle-freeness in Boolean functions
    Arnab Bhattacharyya
    Ning Xie
    computational complexity, 2015, 24 : 65 - 101
  • [24] Lower bounds for testing triangle-freeness in Boolean functions
    Bhattacharyya, Arnab
    Xie, Ning
    COMPUTATIONAL COMPLEXITY, 2015, 24 (01) : 65 - 101
  • [25] Polynomial C1 shape functions on the triangle
    Papanicolopulos, S. -A.
    Zervos, A.
    COMPUTERS & STRUCTURES, 2013, 118 : 53 - 58
  • [26] Polynomial transformation of Boolean functions: Analysis of computational algorithms
    Akinin, A. A.
    Achkasov, A. V.
    Podval'nyi, S. L.
    Tyurin, S. V.
    AUTOMATION AND REMOTE CONTROL, 2014, 75 (07) : 1301 - 1308
  • [27] Polynomial expansions of boolean functions in images of nonhomogeneous operators
    S. F. Vinokurov
    N. A. Peryazev
    Cybernetics and Systems Analysis, 2000, 36 : 345 - 358
  • [28] Polynomial expansions of Boolean functions in images of nonhomogeneous operators
    Vinokurov, SF
    Peryazev, NA
    CYBERNETICS AND SYSTEMS ANALYSIS, 2000, 36 (03) : 345 - 358
  • [29] Polynomial transformation of Boolean functions: Analysis of computational algorithms
    A. A. Akinin
    A. V. Achkasov
    S. L. Podval’nyi
    S. V. Tyurin
    Automation and Remote Control, 2014, 75 : 1301 - 1308
  • [30] A note on the polynomial form of Boolean functions and related topics
    Falkowski, BJ
    IEEE TRANSACTIONS ON COMPUTERS, 1999, 48 (08) : 860 - 864