Logic circuits from zero forcing

DOI10.1007/s11047-014-9438-5zbMath1416.94079OpenAlexW3100372201WikidataQ41964632 ScholiaQ41964632MaRDI QIDQ2003480

Yanyan Li

Publication date: 8 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-014-9438-5

zbMATH Keywords

logic circuitszero forcingadiabatic quantum computation

Mathematics Subject Classification ID

Related Items (27)

GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED ⋮ Computational approaches for zero forcing and related problems ⋮ k-Forcing number for Cartesian product of some graphs ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ Improved Computational Approaches and Heuristics for Zero Forcing ⋮ Total forcing sets and zero forcing sets in trees ⋮ Some properties of the closed global shadow graphs and their zero forcing number ⋮ On the universality of the quantum approximate optimization algorithm ⋮ Some bounds on the zero forcing number of a graph ⋮ On graphs maximizing the zero forcing number ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Bounding the total forcing number of graphs ⋮ Zero forcing number, Grundy domination number, and their variants ⋮ On the total forcing number of a graph ⋮ Zero forcing in Benzenoid network ⋮ The zero forcing polynomial of a graph ⋮ The forcing number of graphs with given girth ⋮ On the nullity of a connected graph in terms of order and maximum degree ⋮ Bounds on the connected forcing number of a graph ⋮ Total forcing versus total domination in cubic graphs ⋮ Complexity and computation of connected zero forcing ⋮ A short proof for a lower bound on the zero forcing number ⋮ Zero forcing number of degree splitting graphs and complete degree splitting graphs ⋮ Note on forcing problem of trees ⋮ Unnamed Item ⋮ A computational comparison of compact MILP formulations for the zero forcing number ⋮ On extremal graphs for zero forcing number

Cites Work

• The monotone circuit complexity of Boolean functions
• Conservative logic
• New digit-serial implementations of stack filters
• Any monotone function is realized by interlocked polygons
• Zero forcing sets and the minimum rank of graphs
• Synthesis and optimization of reversible circuits—a survey
• Nondiscriminatory propagation on trees
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logic circuits from zero forcing