Logic circuits from zero forcing
type: Item
instance of: scholarly article
title: Logic circuits from zero forcing
zbMATH Open document ID: 1416.94079
author: Yanyan Li
published in: Natural Computing
publication date: 2019-07-08T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 7077570
zbMATH Keywords: zero forcing
zbMATH Keywords: logic circuits
zbMATH Keywords: adiabatic quantum computation
Wikidata QID: Q41964632
MaRDI profile type: Publication
full work available at URL: s11047-014-9438-5
OpenAlex ID: W3100372201
cites work: The monotone circuit complexity of Boolean functions
cites work: Zero forcing sets and the minimum rank of graphs
cites work: New digit-serial implementations of stack filters
cites work: Q3622244
cites work: Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
cites work: Any monotone function is realized by interlocked polygons
cites work: Conservative logic
cites work: Q3998976
cites work: Q3758729
cites work: Q3918047
cites work: Synthesis and optimization of reversible circuits -- a survey
cites work: Nondiscriminatory propagation on trees
cites work: Q3886867
DOI: 10.1007/S11047-014-9438-5
description: scientific article; zbMATH DE number 7077570