Symmetry Detection for Large Boolean Functions Using Circuit Representation, Simulation, and Satisfiability

Proceedings - Design Automation Conference - China
doi 10.1109/dac.2006.229269
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Shatter: Efficient Symmetry-Breaking for Boolean Satisfiability

English

Bi-Decomposing Large Boolean Functions via Interpolation and Satisfiability Solving

2008English

Symbolic Manipulation of Boolean Functions Using a Graphical Representation

1985English

Using Non-Symmetry and Anti-Packing Representation Model for Object Detection

2010English

The Monotone Circuit Complexity of Boolean Functions

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1987English

Exact Minimum Factoring of Incompletely Specified Logic Functions via Quantified Boolean Satisfiability

IPSJ Transactions on System LSI Design Methodology
Electronic EngineeringComputer Science ApplicationsElectrical
2011English

Boolean Satisfiability With Transitivity Constraints

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2002English

Boolean Satisfiability in Quantum Compilation

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2019English

Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy