A Satisfiability-Based Approximate Algorithm for Logic Synthesis Using Switching Lattices

Keyphrases

• Logic Functions 100%
• Switching Lattices 100%
• Approximate Method 100%
• Logic Synthesis 100%
• Approximation Algorithms 100%
• Janus 100%
• Exact Method 100%
• Mapping Problem 66%
• Synthesis Problem 66%
• Four-terminal Switch 33%
• Search Space 33%
• Boolean Functions 33%
• Time Limits 33%
• Satisfiability Problem 33%
• Switch number 33%
• Minimum Size 33%
• Two-dimensional Array 33%
• Dichotomous Search 33%
• Reasonable Time 33%
• Maximum Gain 33%
• Multiple Logics 33%

Computer Science

• Logic Synthesis 100%
• Approximate Algorithm 100%
• Synthesis Problem 100%
• Search Space 50%
• Boolean Function 50%
• Satisfiability Problem 50%
• Two-Dimensional Array 50%
• Experimental Result 50%

Mathematics

• Approximates 100%
• Lattices 100%
• Logic Function 30%
• Upper Bound 10%
• Search Space 10%
• Boolean Function 10%