Pages that link to "Item:Q1330665"

The following pages link to On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs (Q1330665):

Displayed 1 item.

• On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) ‎ (← links)