Quartz 5

Home

❯

notes

❯

multiplicative_complexity

multiplicative_complexity

Jun 28, 20261 min read

multiplicative complexity

A Logic Synthesis Toolbox for Reducing the Multiplicative Complexity in Logic Networks で定義
ブール関数を構成するANDゲートの最小数
実際のANDゲートはそれ以上になるので下限とも言える


Graph View

Backlinks

  • MOC: 暗号/CTF
  • A Logic Synthesis Toolbox for Reducing the Multiplicative Complexity in Logic Networks

Created with Quartz v5.0.0 © 2026

  • GitHub
  • Discord Community