Show that EQUI - C is NP-hard and NP-complete

后端 未结 0 1817
闹比i
闹比i 2020-11-29 11:42

Can someone help me with this problem ?

EQUI - C ∶ = {〈C〉 | is a Boolean circuit with at least 2^(n-1)/2 satisfying assignments}

where n refers to the number o

相关标签:
回答
  • 消灭零回复
提交回复
热议问题