Exact Synthesis of ESOP Forms

DOI10.1007/978-3-030-20323-8_8zbMath1528.94129arXiv1807.11103OpenAlexW2996462315MaRDI QIDQ6181733

Heinz Riener, Unnamed Author, Giovanni De Micheli, Rüdiger Ehlers

Publication date: 23 January 2024

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

Full work available at URL: https://arxiv.org/abs/1807.11103

zbMATH Keywords

logic synthesisESOPReed-Muller formslogic minimizationexact synthesis

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A continuous approach to inductive inference
• Young subgroups for reversible computers.
• Conservative logic
• Improved Garbled Circuit: Free XOR Gates and Applications
• Pseudo-Kronecker expressions for symmetric functions
• Theory and Applications of Satisfiability Testing

This page was built for publication: Exact Synthesis of ESOP Forms