SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism-Reference-Cited by-同舟云学术

SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism

Published:2020-04 Issue:4 Volume:39 Page:871-884
ISSN:0278-0070
Container-title:IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
language:
Short-container-title:IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

Author:

Haaswijk Winston^ORCID,Soeken Mathias^ORCID,Mishchenko Alan,De Micheli Giovanni^ORCID

Funder

Semiconductor Research Corporation

H2020 European Research Council

Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Software

Link

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Incremental SAT-based Exact Synthesis;Proceedings of the Great Lakes Symposium on VLSI 2024;2024-06-12

2. Multiplication Complexity Optimization based on Quantified Boolean Formulas;2024 2nd International Symposium of Electronics Design Automation (ISEDA);2024-05-10

3. Scalable Logic Rewriting Using Don't Cares;2024 Design, Automation & Test in Europe Conference & Exhibition (DATE);2024-03-25

4. Algebraic and Boolean Methods for SFQ Superconducting Circuits;2024 29th Asia and South Pacific Design Automation Conference (ASP-DAC);2024-01-22

5. Using Boolean Satisfiability for Exact Shuttling in Trapped-Ion Quantum Computers;2024 29th Asia and South Pacific Design Automation Conference (ASP-DAC);2024-01-22