The following pages link to (Q3976790):
Displaying 9 items.
- A minimization version of a directed subgraph homeomorphism problem (Q1014308) (← links)
- The worst-case chip problem (Q1029103) (← links)
- Processor optimization for flow graphs (Q1200808) (← links)
- Instance-specific accelerators for minimum covering (Q1425007) (← links)
- Some new results in the complexity of allocation and binding in data path synthesis (Q1608404) (← links)
- Easy and difficult exact covering problems arising in VLSI power reduction by clock gating (Q2339838) (← links)
- Memory management optimization problems for integrated circuit simulators (Q2383536) (← links)
- Exploiting the structure of conflict graphs in high level synthesis (Q4299118) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710800) (← links)