An improvement on the complexity of factoring read-once Boolean functions

Keyphrases

• Read-once Function 100%
• Positive Boolean Function 50%
• Prime Implicants 50%
• Readability 25%
• Polynomial-time Algorithm 25%
• Normality 25%
• Function-based 25%
• Boolean Functions 25%
• Kd-tree 25%
• Cograph 25%
• Characterization Theorem 25%
• Read-once 25%
• Complexity Bounds 25%
• Co-occurrence Graph 25%
• Logic Design 25%
• Learning Logics 25%
• Logic Verification 25%
• Computational Learning Theory 25%
• DNF Formulas 25%

Mathematics

• Boolean Function 100%
• Polynomial Time 25%
• Renewed Interest 25%