Pages that link to "Item:Q4267798"
From MaRDI portal
The following pages link to Complexity of problems on graphs represented as OBDDs (Q4267798):
Displaying 12 items.
- Model-checking hierarchical structures (Q414908) (← links)
- Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Symbolic graphs: Linear solutions to connectivity related problems (Q2471809) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- (Q4694758) (← links)
- Sequential Relational Decomposition (Q5094122) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711546) (← links)