Complexity of implementation of parity functions in the ``implication-negation'' basis
type: Item
instance of: scholarly article
zbMATH Open document ID: 1347.94078
author: Yu. A. Kombarov
published in: Discrete Mathematics and Applications
publication date: 2016-09-13T00:00:00Z
Mathematics Subject Classification ID: 94C11
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 94D10
zbMATH DE Number: 6626606
zbMATH Keywords: circuit
zbMATH Keywords: parity function
zbMATH Keywords: minimal circuit
zbMATH Keywords: complexity circuits
MaRDI profile type: Publication
full work available at URL: dma-2015-0021
OpenAlex ID: W2520783283
DOI: 10.1515/DMA-2015-0021
Recommended article: On the parity complexity measures of Boolean functions
Recommended article: Complexity and structure of circuits for parity functions
Recommended article: Negation-limited complexity of parity and inverters
Recommended article: Negation-Limited Complexity of Parity and Inverters
Recommended article: Complexity and Limiting Ratio of Boolean Functions over Implication
Recommended article: Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
Recommended article: The complexity of the parity function in unbounded fan-in, unbounded depth circuits
Recommended article: Complexity of implementation of Boolean functions by real formulas
Recommended article: Parity, circuits, and the polynomial-time hierarchy
Recommended article: Complexity of sequential implementation of partial Boolean functions
title: Complexity of implementation of parity functions in the ``implication-negation'' basis
description: scientific article; zbMATH DE number 6626606