Logic circuits from zero forcing
From MaRDI portal
Recommendations
Cites work
- A protocol for cooling and controlling composite systems by local interactions
- Any monotone function is realized by interlocked polygons
- Conservative logic
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 3692653 (Why is no real title available?)
- scientific article; zbMATH DE number 3730059 (Why is no real title available?)
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- New digit-serial implementations of stack filters
- Nondiscriminatory propagation on trees
- Synthesis and optimization of reversible circuits -- a survey
- The monotone circuit complexity of Boolean functions
- Zero forcing sets and the minimum rank of graphs
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
Cited in
(38)- Computational approaches for zero forcing and related problems
- Some bounds on the zero forcing number of a graph
- Zero forcing number, Grundy domination number, and their variants
- On the total forcing number of a graph
- The zero forcing polynomial of a graph
- Bounds on the connected forcing number of a graph
- Total forcing versus total domination in cubic graphs
- Complexity and computation of connected zero forcing
- Note on forcing problem of trees
- On extremal graphs for zero forcing number
- On trees and unicyclic graphs with equal forcing-type numbers
- Total forcing sets and zero forcing sets in trees
- On the nullity of a connected graph in terms of order and maximum degree
- A short proof for a lower bound on the zero forcing number
- Zero forcing number of degree splitting graphs and complete degree splitting graphs
- A computational comparison of compact MILP formulations for the zero forcing number
- Some properties of the closed global shadow graphs and their zero forcing number
- On the universality of the quantum approximate optimization algorithm
- Few Product Gates But Many Zeros
- The forcing number of graphs with given girth
- Graphs with total forcing number two, revisited
- k-forcing number for Cartesian product of some graphs
- Improved Computational Approaches and Heuristics for Zero Forcing
- On the zero forcing number of graphs and their splitting graphs
- Zero forcing in benzenoid network
- scientific article; zbMATH DE number 6292740 (Why is no real title available?)
- 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
- The zero forcing number of claw-free cubic graphs
- Minimal zero forcing sets
- On the zero forcing number of complementary prism graphs
- The extremal results for forcing problem of trees
- Semitotal forcing in claw-free cubic graphs
- Some results on the total (zero) forcing number of a graph
- Zero forcing of generalized hierarchical products
- On the zero forcing number of trees
- Controllability backbone in multiagent networks
This page was built for publication: Logic circuits from zero forcing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003480)
