Pages that link to "Item:Q1330665"
From MaRDI portal
The following pages link to On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs (Q1330665):
Displaying 5 items.
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms (Q800318) (← links)
- On the computational power of Boolean decision lists (Q853647) (← links)
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) (← links)
- Analysis of Boolean Programs (Q5326327) (← links)