Logic circuits from zero forcing (Q2003480): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New digit-serial implementations of stack filters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3622244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Any monotone function is realized by interlocked polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis and optimization of reversible circuits—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondiscriminatory propagation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886867 / rank
 
Normal rank

Revision as of 19:25, 19 July 2024

scientific article
Language Label Description Also known as
English
Logic circuits from zero forcing
scientific article

    Statements

    Logic circuits from zero forcing (English)
    0 references
    0 references
    8 July 2019
    0 references
    zero forcing
    0 references
    logic circuits
    0 references
    adiabatic quantum computation
    0 references

    Identifiers