Polynomial-size binary decision diagrams for the Exactly half-d-hyperclique problem reading each input bit twice

Abstract

Annotation is : We construct polynomial-size free binary decision diagrams for the Exactly half-d-hyperclique problem.

Keywords

• Polynomial-size
• binary
• decision
• diagrams
• Exactly
• half-d-hyperclique
• problem
• reading
• input
• twice