On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials
type: Item
instance of: scholarly article
title: On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials
zbMATH Open document ID: 1024.06007
DOI: 10.1023/A:1013898304645
published in: Cybernetics and Systems Analysis
publication date: 2003-09-16T00:00:00Z
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 1981947
zbMATH Keywords: Boolean functions
zbMATH Keywords: polynomial expansions of Boolean functions
zbMATH Keywords: Zhegalkin polynomials
zbMATH Keywords: values of partial derivatives of Boolean functions
zbMATH Keywords: combinational complexity of partial derivatives
zbMATH Keywords: optimal computation of partial derivatives
author: A. N. Alekseychuk
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1981947