Literal Selection in Switching Lattice Design

DOI10.1007/978-3-030-20323-8_7zbMath1528.94126OpenAlexW2959157696MaRDI QIDQ6181731

Linda Pagli, Fabrizio Luccio, Anna Bernasconi, Unnamed Author

Publication date: 23 January 2024

Published in: Advanced Boolean Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-20323-8_7

zbMATH Keywords

logic synthesisliteral selectionswitching lattices

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites Work

• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• Synthesis of autosymmetric functions in a new three-level form
• Parallel machine scheduling of machine-dependent jobs with unit-length.
• Predictors for flat membrane systems
• Multiset patterns and their application to dynamic causalities in membrane systems
• Exploiting regularities for Boolean function synthesis
• Using Flexibility in P-Circuits by Boolean Relations
• GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
• Logic Synthesis for Switching Lattices
• Semi-matchings for bipartite graphs and load balancing
• A Rectangular Logic Array
• Computing preimages and ancestors in reaction systems

This page was built for publication: Literal Selection in Switching Lattice Design