SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism
Authors:
- Winston HaaswijkWHWinston Haaswijk
- Mathias SoekenMSMathias Soeken
- Alan MishchenkoAMAlan Mishchenko
- Giovanni De MicheliGMGiovanni De Micheli
- 5 February 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 39 (4) , 871-884
Abstract
No abstract availableKeywords
Funding Information
- Semiconductor Research Corporation
- H2020 European Research Council (H2020-ERC-2014-ADG 669354)
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (200021-169084)
This publication has 28 references indexed in Scilit:
- Practical graph isomorphism, IIJournal of Symbolic Computation, 2014
- Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads2012
- Finding Efficient Circuits Using SAT-SolversLecture Notes in Computer Science, 2009
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints2005
- An Extensible SAT-solver2004
- EXMIN2: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functionsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Multilevel logic synthesisProceedings of the IEEE, 1990
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- Minimization of Boolean Functions*Bell System Technical Journal, 1956
- The Problem of Simplifying Truth FunctionsThe American Mathematical Monthly, 1952